A Polynomial Time Approximation Scheme for k-Consensus Clustering
Author
Coleman, T; Wirth, ADate
2010-01-01Source Title
PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMSPublisher
SIAMAffiliation
Computer Science and Software EngineeringMetadata
Show full item recordDocument Type
Conference PaperCitations
Coleman, T. & Wirth, A. (2010). A Polynomial Time Approximation Scheme for k-Consensus Clustering. PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 135, pp.729-740. SIAM. https://doi.org/10.1137/1.9781611973075.59.Access Status
This item is currently not available from this repositoryDescription
ACM/SIAM Symposium on Discrete Agorithms (SODA)
Keywords
Artificial Intelligence and Image ProcessingExport Reference in RIS Format
Endnote
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
Refworks
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References