@InProceedings{mcclintock_et_al:LIPIcs.ISAAC.2017.55,
author = {McClintock, Jessica and Mestre, Juli\'{a}n and Wirth, Anthony},
title = {{Precedence-Constrained Min Sum Set Cover}},
booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)},
pages = {55:1--55:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-054-5},
ISSN = {1868-8969},
year = {2017},
volume = {92},
editor = {Okamoto, Yoshio and Tokuyama, Takeshi},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.55},
URN = {urn:nbn:de:0030-drops-82648},
doi = {10.4230/LIPIcs.ISAAC.2017.55},
annote = {Keywords: planted dense subgraph, min sum set cover, precedence constrained}
}