@InProceedings{vanheuvenvanstaereling_et_al:LIPIcs.MFCS.2016.50,
author = {van Heuven van Staereling, Irving and de Keijzer, Bart and Sch\"{a}fer, Guido},
title = {{The Ground-Set-Cost Budgeted Maximum Coverage Problem}},
booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
pages = {50:1--50:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-016-3},
ISSN = {1868-8969},
year = {2016},
volume = {58},
editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.50},
URN = {urn:nbn:de:0030-drops-65020},
doi = {10.4230/LIPIcs.MFCS.2016.50},
annote = {Keywords: maximum coverage problem, approximation algorithms, hypergraphs, submodular optimization, sponsored search}
}