A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
type: Item
instance of: scholarly article
title: A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
zbMATH Open document ID: 1280.68093
author: Paola Bonizzoni
author: Gianluca Della Vedova
author: Riccardo Dondi
published in: Theoretical Computer Science
publication date: 2012-05-30T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 6039159
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.12.022
OpenAlex ID: W2004594428
cites work: Data Integration in the Life Sciences
cites work: NP-hard problems in hierarchical-tree clustering
cites work: The complexity of computing medians of relations.
cites work: Optimization, approximation, and complexity classes
cites work: Approximate solution of NP optimization problems
cites work: Aggregating inconsistent information
cites work: A cutting plane algorithm for a clustering problem
cites work: On the approximation of correlation clustering and consensus clustering
cites work: Q3002775
cites work: Approximation schemes for clustering problems
cites work: Correlation clustering
cites work: Clustering with qualitative information
cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
cites work: Algorithms - ESA 2003
cites work: Q5501301
cites work: Q5417662
cites work: Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
cites work: Q4198056
DOI: 10.1016/J.TCS.2011.12.022
Recommended article: On the parameterized complexity of consensus clustering
Recommended article: On the Parameterized Complexity of Consensus Clustering
Recommended article: Q5417662
Recommended article: A randomized algorithm for estimating the number of clusters
Recommended article: Approximation algorithms for min-sum \(p\)-clustering
Recommended article: On constructing an optimal consensus clustering from multiple clusterings
Recommended article: PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem
Recommended article: A unified framework of FPT approximation algorithms for clustering problems
Recommended article: A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems
Recommended article: A PTAS for k-means clustering based on weak coresets
description: scientific article; zbMATH DE number 6039159