A randomized PTAS for the minimum consensus clustering with a fixed number of clusters

DOI10.1016/j.tcs.2011.12.022zbMath1280.68093OpenAlexW2004594428MaRDI QIDQ418755

Gianluca Della Vedova, Paola Bonizzoni, Riccardo Dondi

Publication date: 30 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.022

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (2)

Parameterized algorithms for min-max 2-cluster editing ⋮ On the parameterized complexity of consensus clustering

Cites Work

• Approximate solution of NP optimization problems
• Correlation clustering
• On the approximation of correlation clustering and consensus clustering
• NP-hard problems in hierarchical-tree clustering
• A cutting plane algorithm for a clustering problem
• Optimization, approximation, and complexity classes
• Clustering with qualitative information
• Approximation schemes for clustering problems
• Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
• Data Integration in the Life Sciences
• Algorithms - ESA 2003
• Aggregating inconsistent information
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A randomized PTAS for the minimum consensus clustering with a fixed number of clusters