Martin Dörnfelder

Learn More
Given a collection C of partitions of a base set S, the NP-hard Consensus Clustering problem asks for a partition of S which has a total Mirkin distance of at most t to the partitions in C, where t is a non-negative integer. We present a parameterized algorithm for Consensus Clustering with running time O(4.24 k · k 3 + |C| · |S| 2), where k := t/|C| is the(More)
  • 1