Clustering in Hypergraphs to Minimize Average Edge Service Time

DOI10.4230/LIPICS.ESA.2017.64MaRDI QIDQ5111753zbMATH OpenOpenAlexFDO

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/

zbMATH Keywords

clusteringhypergraphsset coveraverage cover time

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 432790 (Why is no real title available?)
• scientific article; zbMATH DE number 3495588 (Why is no real title available?)
• A Greedy Heuristic for the Set-Covering Problem
• A generalization of the Motzkin-Straus theorem to hypergraphs
• A threshold of ln n for approximating set cover
• Additive Schwarz Iterations for Markov Chains
• An improved algorithm for the Jardine-Sibson method of generating overlapping clusters
• Clustering Social Networks
• Correlation clustering
• Non-approximability results for optimization problems on bounded degree instances
• On the ratio of optimal integral and fractional covers
• Paths, Trees, and Flowers
• Reducibility among combinatorial problems
• Spectral partitioning works: planar graphs and finite element meshes
• Weighted max norms, splittings, and overlapping additive Schwarz iterations
• Well-Separated Clusters and Optimal Fuzzy Partitions

Cited in

(1)

• Clustering in hypergraphs to minimize average edge service time

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)