Back to Results
First PageMeta Content
Approximation algorithms / Cluster analysis / Combinatorial optimization / NP-complete problems / Complexity classes / Correlation clustering / Consensus clustering / Optimization problem / Minimum k-cut / Theoretical computer science / Computational complexity theory / Statistics


A Polynomial Time Approximation Scheme for k-Consensus Clustering∗ Tom Coleman† Abstract This paper introduces a polynomial time approximation scheme for the metric Correlation Clustering problem, when the number of
Add to Reading List

Document Date: 2015-05-04 03:09:24

Open Document

File Size: 236,73 KB

Share Result on Facebook
UPDATE