A Structural View on Parameterizing Problems: Distance from Triviality

  • Jiong Guo
  • Falk Hüffner
  • Rolf Niedermeier
Conference paper

DOI: 10.1007/978-3-540-28639-4_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3162)
Cite this paper as:
Guo J., Hüffner F., Niedermeier R. (2004) A Structural View on Parameterizing Problems: Distance from Triviality. In: Downey R., Fellows M., Dehne F. (eds) Parameterized and Exact Computation. IWPEC 2004. Lecture Notes in Computer Science, vol 3162. Springer, Berlin, Heidelberg

Abstract

Based on a series of known and new examples, we propose the generalized setting of “distance from triviality” measurement as a reasonable and prospective way of determining useful structural problem parameters in analyzing computationally hard problems. The underlying idea is to consider tractable special cases of generally hard problems and to introduce parameters that measure the distance from these special cases. In this paper we present several case studies of distance from triviality parameterizations (concerning Clique, Power Dominating Set, Set Cover, and Longest Common Subsequence) that exhibit the versatility of this approach to develop important new views for computational complexity analysis.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jiong Guo
    • 1
  • Falk Hüffner
    • 1
  • Rolf Niedermeier
    • 1
  1. 1.Wilhelm-Schickard-Institut für InformatikUniversität TübingenTübingenFed. Rep. of Germany

Personalised recommendations