@inproceedings{d7d3e19114f84e36874341f8cd30fdae,
title = "Clustering in hypergraphs to minimize average edge service time",
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.",
keywords = "Average cover time, Clustering, Hypergraphs, Set cover",
author = "Ori Rottenstreich and Haim Kaplan and Avinatan Hassidim",
note = "Funding Information: ∗ Work by Haim Kaplan has been supported by Grant 1161/2011 from the German-Israeli Science Foundation, by Grant 1841-14 from the Israel Science Foundation, and by the Israeli Centers for Research Excellence (I-CORE) program (center no. 4/11). 1 This medical setting may remind the reader of group testing. In group testing we want to locate individuals who have a certain property by testing the individuals against groups of properties, rather than against individual ones, and we want to minimize the number of groups. Here we also group properties into tests, but we may have different properties that we try to locate among different subsets and our objective is different.; 25th European Symposium on Algorithms, ESA 2017 ; Conference date: 04-09-2017 Through 06-09-2017",
year = "2017",
month = sep,
day = "1",
doi = "10.4230/LIPIcs.ESA.2017.64",
language = "אנגלית",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Christian Sohler and Christian Sohler and Kirk Pruhs",
booktitle = "25th European Symposium on Algorithms, ESA 2017",
}