Clustering in hypergraphs to minimize average edge service time

Ori Rottenstreich; Haim Kaplan; Avinatan Hassidim

doi:10.4230/LIPIcs.ESA.2017.64

Clustering in hypergraphs to minimize average edge service time

Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	25th European Symposium on Algorithms, ESA 2017
Editors	Christian Sohler, Christian Sohler, Kirk Pruhs
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959770491
DOIs	https://doi.org/10.4230/LIPIcs.ESA.2017.64
State	Published - 1 Sep 2017
Event	25th European Symposium on Algorithms, ESA 2017 - Vienna, Austria Duration: 4 Sep 2017 → 6 Sep 2017

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	87
ISSN (Print)	1868-8969

Conference

Conference	25th European Symposium on Algorithms, ESA 2017
Country/Territory	Austria
City	Vienna
Period	4/09/17 → 6/09/17

Bibliographical 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.

Keywords

Average cover time
Clustering
Hypergraphs
Set cover

Access to Document

10.4230/LIPIcs.ESA.2017.64

Cite this

Rottenstreich, O., Kaplan, H., & Hassidim, A. (2017). Clustering in hypergraphs to minimize average edge service time. In C. Sohler, C. Sohler, & K. Pruhs (Eds.), 25th European Symposium on Algorithms, ESA 2017 Article 64 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 87). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2017.64

Rottenstreich, Ori ; Kaplan, Haim ; Hassidim, Avinatan. / Clustering in hypergraphs to minimize average edge service time. 25th European Symposium on Algorithms, ESA 2017. editor / Christian Sohler ; Christian Sohler ; Kirk Pruhs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{999ac0c059b04af9bc676c884b186d99,

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",

address = "גרמניה",

}

Rottenstreich, O, Kaplan, H & Hassidim, A 2017, Clustering in hypergraphs to minimize average edge service time. in C Sohler, C Sohler & K Pruhs (eds), 25th European Symposium on Algorithms, ESA 2017., 64, Leibniz International Proceedings in Informatics, LIPIcs, vol. 87, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 25th European Symposium on Algorithms, ESA 2017, Vienna, Austria, 4/09/17. https://doi.org/10.4230/LIPIcs.ESA.2017.64

Clustering in hypergraphs to minimize average edge service time. / Rottenstreich, Ori; Kaplan, Haim; Hassidim, Avinatan.
25th European Symposium on Algorithms, ESA 2017. ed. / Christian Sohler; Christian Sohler; Kirk Pruhs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. 64 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 87).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Clustering in hypergraphs to minimize average edge service time

AU - Rottenstreich, Ori

AU - Kaplan, Haim

AU - Hassidim, Avinatan

N1 - 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.

PY - 2017/9/1

Y1 - 2017/9/1

N2 - 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.

AB - 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.

KW - Average cover time

KW - Clustering

KW - Hypergraphs

KW - Set cover

UR - http://www.scopus.com/inward/record.url?scp=85030544757&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ESA.2017.64

DO - 10.4230/LIPIcs.ESA.2017.64

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85030544757

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 25th European Symposium on Algorithms, ESA 2017

A2 - Sohler, Christian

A2 - Pruhs, Kirk

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 25th European Symposium on Algorithms, ESA 2017

Y2 - 4 September 2017 through 6 September 2017

ER -

Rottenstreich O, Kaplan H, Hassidim A. Clustering in hypergraphs to minimize average edge service time. In Sohler C, Sohler C, Pruhs K, editors, 25th European Symposium on Algorithms, ESA 2017. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2017. 64. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.ESA.2017.64

Clustering in hypergraphs to minimize average edge service time

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this