Clustering in hypergraphs to minimize average edge service time

Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We study the problem of clustering the vertices of a weighted hypergraph such that on average the vertices of each edge can be covered by a small number of clusters. This problem has many applications such as for designing medical tests, clustering files on disk servers, and placing network services on servers. The edges of the hypergraph model groups of items that are likely to be needed together, and the optimization criteria which we use can be interpreted as the average delay (or cost) to serve the items of a typical edge. We describe and analyze algorithms for this problem for the case in which the clusters have to be disjoint and for the case where clusters can overlap. The analysis is often subtle and reveals interesting structure and invariants that one can utilize.

Original languageEnglish
Title of host publication25th European Symposium on Algorithms, ESA 2017
EditorsChristian Sohler, Christian Sohler, Kirk Pruhs
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770491
DOIs
StatePublished - 1 Sep 2017
Event25th European Symposium on Algorithms, ESA 2017 - Vienna, Austria
Duration: 4 Sep 20176 Sep 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume87
ISSN (Print)1868-8969

Conference

Conference25th European Symposium on Algorithms, ESA 2017
Country/TerritoryAustria
CityVienna
Period4/09/176/09/17

Keywords

  • Average cover time
  • Clustering
  • Hypergraphs
  • Set cover

Fingerprint

Dive into the research topics of 'Clustering in hypergraphs to minimize average edge service time'. Together they form a unique fingerprint.

Cite this