Average parameterization and partial kernelization for computing medians

  • Authors:

  • Nadja Betzler;Jiong Guo;Christian Komusiewicz;Rolf Niedermeier

  • Affiliations:

  • Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Universität des Saarlandes, Saarbrücken, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany

  • Venue:
  • LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
  • Year:
  • 2010

Quantified Score

Hi-index 0.02

Visualization

Abstract

We propose an effective polynomial-time preprocessing strategy for intractable median problems. Developing a new methodological framework, we show that if the input instances of generally intractable problems exhibit a sufficiently high degree of similarity between each other on average, then there are efficient exact solving algorithms. In other words, we show that the median problems Swap Median Permutation, Consensus Clustering, Kemeny Score, and Kemeny Tie Score all are fixed-parameter tractable with respect to the parameter “average distance between input objects”. To this end, we develop the new concept of “partial kernelization” and identify interesting polynomial-time solvable special cases for the considered problems.