On the Parameterized Complexity of Consensus Clustering

DOI10.1007/978-3-642-25591-5_64zbMath1350.68137OpenAlexW28076064MaRDI QIDQ3104664

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

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

Related Items (1)

Local search for string problems: brute-force is essentially optimal

This page was built for publication: On the Parameterized Complexity of Consensus Clustering