@InProceedings{im_et_al:LIPIcs.STACS.2012.465,
author = {Im, Sungjin and Sviridenko, Maxim and van der Zwaan, Ruben},
title = {{Preemptive and Non-Preemptive Generalized Min Sum Set Cover}},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
pages = {465--476},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-35-4},
ISSN = {1868-8969},
year = {2012},
volume = {14},
editor = {D\"{u}rr, Christoph and Wilke, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.465},
URN = {urn:nbn:de:0030-drops-33991},
doi = {10.4230/LIPIcs.STACS.2012.465},
annote = {Keywords: Set Cover, Approximation, Preemption, Latency, Average cover time}
}