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]
@inproceedings{ColemanW10, title = {A Polynomial Time Approximation Scheme for k-Consensus Clustering}, author = {Tom Coleman and Anthony Wirth}, year = {2010}, url = {http://www.siam.org/proceedings/soda/2010/SODA10_059_colemant.pdf}, researchr = {https://researchr.org/publication/ColemanW10}, cites = {0}, citedby = {0}, pages = {729-740}, booktitle = {Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010}, editor = {Moses Charikar}, publisher = {SIAM}, }