Approximation algorithms on k-correlation clustering of uniform hypergraphs

DOI10.1007/978-981-96-4445-2_39MaRDI QIDQ6909201zbMATH OpenFDO

Authors Zhongzheng Tang, Yaxuan Li, Zhuo Diao

Publication date 29 October 2025

Full work available at URL https://doi.org/10.1007/978-981-96-4445-2_39

zbMATH Keywords

\(k\)-correlation clustersapproximation algorithmschoosing the better of two solutions

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat}
• Clustering in hypergraphs to minimize average edge service time
• Exact recovery in the hypergraph stochastic block model: a spectral algorithm
• scientific article; zbMATH DE number 1670644 (Why is no real title available?)
• scientific article; zbMATH DE number 1263204 (Why is no real title available?)
• Hypergraph \(k\)-cut in randomized polynomial time
• Hypergraph clustering using a new Laplacian tensor with applications in image processing
• Judicious partitions of weighted hypergraphs

This page was built for publication: Approximation algorithms on \(k\)-correlation clustering of uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909201)