Clustering in Hypergraphs to Minimize Average Edge Service Time
From MaRDI portal
Publication:5111753
DOI10.4230/LIPIcs.ESA.2017.64zbMath1442.68183OpenAlexW2756494378MaRDI QIDQ5111753
Haim Kaplan, Avinatan Hassidim, Ori Rottenstreich
Publication date: 27 May 2020
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7877/pdf/LIPIcs-ESA-2017-64.pdf/
Analysis of algorithms (68W40) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Correlation clustering
- Spectral partitioning works: planar graphs and finite element meshes
- A generalization of the Motzkin-Straus theorem to hypergraphs
- On the ratio of optimal integral and fractional covers
- Weighted max norms, splittings, and overlapping additive Schwarz iterations
- A threshold of ln n for approximating set cover
- Reducibility Among Combinatorial Problems
- A Greedy Heuristic for the Set-Covering Problem
- Well-Separated Clusters and Optimal Fuzzy Partitions
- Non-approximability results for optimization problems on bounded degree instances
- Paths, Trees, and Flowers
- Clustering Social Networks
- Additive Schwarz Iterations for Markov Chains
- An improved algorithm for the Jardine-Sibson method of generating overlapping clusters
This page was built for publication: Clustering in Hypergraphs to Minimize Average Edge Service Time
