A Polynomial Time Approximation Scheme for k-Consensus Clustering

Tom Coleman, Anthony Wirth. A Polynomial Time Approximation Scheme for k-Consensus Clustering. In Moses Charikar, editor, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010. pages 729-740, SIAM, 2010. [doi]

Abstract

Abstract is missing.