Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes

DOI10.1007/978-3-030-27195-4_15MaRDI QIDQ6199012zbMATH OpenFDO

Authors

Publication date 23 February 2024

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-27195-4_15

zbMATH Keywords

approximation algorithmcorrelation clusteringnon-uniform hard constrained cluster sizes

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68Wxx)

Recommendations

• Correlation clustering with constrained cluster sizes and extended weights bounds
• Approximation algorithms for two variants of correlation clustering problem
• Graph clustering with a constraint on cluster sizes
• Approximation algorithms on \(k\)-correlation clustering
• Approximation algorithms for the capacitated correlation clustering problem with penalties

Cited in

(1)

• Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs

This page was built for publication: Approximation algorithm for the correlation clustering problem with non-uniform hard constrained cluster sizes

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