On the parameterized complexity of consensus clustering

DOI10.1007/978-3-642-25591-5_64MaRDI QIDQ3104664zbMATH OpenOpenAlexFDO

Authors Martin Dörnfelder, Jiong Guo, Christian Komusiewicz, Mathias Weller

Publication date 16 December 2011

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25591-5_64

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the parameterized complexity of consensus clustering
• A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
• On constructing an optimal consensus clustering from multiple clusterings
• Algorithms and Computation
• On the approximation of correlation clustering and consensus clustering

Cited in

(8)

• On the parameterized complexity of consensus clustering
• Parameterized \(k\)-clustering: tractability island
• Local search for string problems: brute-force is essentially optimal
• A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
• On the convergence of puck clustering systems
• A Biclustering Framework for Consensus Problems
• scientific article; zbMATH DE number 6297742 (Why is no real title available?)
• Clustering and isolation in the consensus problem for partitions

This page was built for publication: On the parameterized complexity of consensus clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104664)