On the approximation of correlation clustering and consensus clustering
type: Item
instance of: scholarly article
title: On the approximation of correlation clustering and consensus clustering
zbMATH Open document ID: 1169.68586
author: Paola Bonizzoni
author: Gianluca Della Vedova
author: Riccardo Dondi
author: Tao Jiang
published in: Journal of Computer and System Sciences
publication date: 2008-06-26T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5293385
zbMATH Keywords: correlation clustering
zbMATH Keywords: consensus clustering
zbMATH Keywords: approximation
zbMATH Keywords: APX-hardness
zbMATH Keywords: PTAS
Wikidata QID: Q59444453
MaRDI profile type: Publication
full work available at URL: j.jcss.2007.06.024
OpenAlex ID: W2028356989
cites work: Aggregating inconsistent information
cites work: Some APX-completeness results for cubic graphs
cites work: Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
cites work: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
cites work: Q4258216
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: Data Integration in the Life Sciences
cites work: A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
cites work: A cutting plane algorithm for a clustering problem
cites work: Algorithms on Strings, Trees and Sequences
cites work: NP-hard problems in hierarchical-tree clustering
cites work: Q5501301
cites work: The complexity of computing medians of relations.
DOI: 10.1016/J.JCSS.2007.06.024
DBLP publication ID: journals/jcss/BonizzoniVDJ08
description: scientific article; zbMATH DE number 5293385