@InProceedings{nederlof:LIPIcs.ESA.2016.69,
author = {Nederlof, Jesper},
title = {{Finding Large Set Covers Faster via the Representation Method}},
booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)},
pages = {69:1--69:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-015-6},
ISSN = {1868-8969},
year = {2016},
volume = {57},
editor = {Sankowski, Piotr and Zaroliagis, Christos},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.69},
URN = {urn:nbn:de:0030-drops-64114},
doi = {10.4230/LIPIcs.ESA.2016.69},
annote = {Keywords: Set Cover, Exact Exponential Algorithms, Fine-Grained Complexity}
}