Published in: LIPIcs, Volume 87, 25th Annual European Symposium on Algorithms (ESA 2017)
Ori Rottenstreich, Haim Kaplan, and Avinatan Hassidim. Clustering in Hypergraphs to Minimize Average Edge Service Time. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 64:1-64:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{rottenstreich_et_al:LIPIcs.ESA.2017.64, author = {Rottenstreich, Ori and Kaplan, Haim and Hassidim, Avinatan}, title = {{Clustering in Hypergraphs to Minimize Average Edge Service Time}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {64:1--64:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.64}, URN = {urn:nbn:de:0030-drops-78777}, doi = {10.4230/LIPIcs.ESA.2017.64}, annote = {Keywords: Clustering, average cover time, hypergraphs, set cover} }
Feedback for Dagstuhl Publishing