Clustering in Hypergraphs to Minimize Average Edge Service Time
DOI10.4230/LIPICS.ESA.2017.64zbMATH Open1442.68183OpenAlexW2756494378MaRDI QIDQ5111753FDOQ5111753
Authors: Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim 
Publication date: 27 May 2020
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7877/pdf/LIPIcs-ESA-2017-64.pdf/
Recommendations
- Clustering in hypergraphs to minimize average edge service time
- Clustering for edge-cost minimization (extended abstract)
- scientific article; zbMATH DE number 7746258
- Optimal clustering of multipartite graphs
- Clustering on k-Edge-Colored Graphs
- Clustering on \(k\)-edge-colored graphs
- Clustering by hypergraphs and dimensionality of cluster systems
- ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM
- Polynomial time approximation schemes for clustering in low highway dimension graphs
Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A threshold of ln n for approximating set cover
- A Greedy Heuristic for the Set-Covering Problem
- Paths, Trees, and Flowers
- Correlation clustering
- On the ratio of optimal integral and fractional covers
- Weighted max norms, splittings, and overlapping additive Schwarz iterations
- Title not available (Why is that?)
- Well-Separated Clusters and Optimal Fuzzy Partitions
- Non-approximability results for optimization problems on bounded degree instances
- A generalization of the Motzkin-Straus theorem to hypergraphs
- Spectral partitioning works: planar graphs and finite element meshes
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- Clustering Social Networks
- Additive Schwarz Iterations for Markov Chains
- An improved algorithm for the Jardine-Sibson method of generating overlapping clusters
Cited In (1)
This page was built for publication: Clustering in Hypergraphs to Minimize Average Edge Service Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111753)
