Clustering in Hypergraphs to Minimize Average Edge Service Time

Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim. Clustering in Hypergraphs to Minimize Average Edge Service Time. In Kirk Pruhs, Christian Sohler, editors, 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria. Volume 87 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

Abstract

Abstract is missing.