Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen. A Technique for Obtaining True Approximations for k-Center with Covering Constraints. In Daniel Bienstock, Giacomo Zambelli, editors, Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings. Volume 12125 of Lecture Notes in Computer Science, pages 52-65, Springer, 2020. [doi]
@inproceedings{AneggAKZ20,
title = {A Technique for Obtaining True Approximations for k-Center with Covering Constraints},
author = {Georg Anegg and Haris Angelidakis and Adam Kurpisz and Rico Zenklusen},
year = {2020},
doi = {10.1007/978-3-030-45771-6_5},
url = {https://doi.org/10.1007/978-3-030-45771-6_5},
researchr = {https://researchr.org/publication/AneggAKZ20},
cites = {0},
citedby = {0},
pages = {52-65},
booktitle = {Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, London, UK, June 8-10, 2020, Proceedings},
editor = {Daniel Bienstock and Giacomo Zambelli},
volume = {12125},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-45771-6},
}