Faster Algorithms for k-Regret Minimizing Sets via Monotonicity and Sampling.
| Anthology ID: | DBLP:conf/cikm/DongZ19 |
|---|---|
| Volume: | Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM 2019, Beijing, China, November 3-7, 2019. |
| Year: | 2019 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 2213-2216 |
| URL: | https://doi.org/10.1145/3357384.3358115 |
| DOI: | https://doi.org/10.1145/3357384.3358115 |
| DBLP: | conf/cikm/DongZ19 |
| BibTeX: |
@inproceedings{dong-2019-faster,
author = {Qi Dong and
Jiping Zheng},
editor = {Wenwu Zhu and
Dacheng Tao and
Xueqi Cheng and
Peng Cui and
Elke A. Rundensteiner and
David Carmel and
Qi He and
Jeffrey Xu Yu},
title = {{Faster Algorithms for k-Regret Minimizing Sets via Monotonicity and Sampling}},
booktitle = {{Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM 2019, Beijing, China, November 3-7, 2019}},
pages = {2213--2216},
publisher = {ACM},
year = {2019},
url = {https://doi.org/10.1145/3357384.3358115},
doi = {https://doi.org/10.1145/3357384.3358115}
}