Clustering in hypergraphs to minimize average edge service time

DOI10.1145/3386121MaRDI QIDQ4987462zbMATH OpenOpenAlexWikidataFDO

Authors Ori Rottenstreich, Haim Kaplan, Avinatan Hassidim

Publication date 3 May 2021

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2017/7877/

zbMATH Keywords

average cover timeclusteringhypergraphsset cover

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Clustering in Hypergraphs to Minimize Average Edge Service Time
• Spectra, Euclidean representations and clusterings of hypergraphs
• scientific article; zbMATH DE number 2075198
• An efficient algorithm for judicious partition of hypergraphs
• Multidimensional clustering and hypergraphs

Cited in

(3)

• Clustering in Hypergraphs to Minimize Average Edge Service Time
• Approximation algorithms on k-correlation clustering of uniform hypergraphs
• A simple approximation algorithm for k-correlation clustering on uniform hypergraphs

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 Q4987462)