A primal-dual framework yields (b_local+1)-, 2(b_robust+1)-, and 2(b_global+1)-approximation algorithms for overlapping and robust edge-colored hypergraph clustering, with matching hardness and integrality gap bounds.
Clustering in graphs and hypergraphs with categorical edge labels
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Improved Algorithms for Overlapping and Robust Clustering of Edge-Colored Hypergraphs: An LP-Based Combinatorial Approach
A primal-dual framework yields (b_local+1)-, 2(b_robust+1)-, and 2(b_global+1)-approximation algorithms for overlapping and robust edge-colored hypergraph clustering, with matching hardness and integrality gap bounds.