A Polynomial Time Approximation Scheme for k-Consensus Clustering

    Thumbnail
    Citations
    Scopus
    Altmetric
    7
    Author
    Coleman, T; Wirth, A
    Date
    2010-01-01
    Source Title
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS
    Publisher
    SIAM
    University of Melbourne Author/s
    Wirth, Anthony; COLEMAN, TOM
    Affiliation
    Computer Science and Software Engineering
    Metadata
    Show full item record
    Document Type
    Conference Paper
    Citations
    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 repository
    URI
    http://hdl.handle.net/11343/31911
    DOI
    10.1137/1.9781611973075.59
    Description

    ACM/SIAM Symposium on Discrete Agorithms (SODA)
    Keywords
    Artificial Intelligence and Image Processing

    Export Reference in RIS Format     

    Collections