A Structural View on Parameterizing Problems: Distance from Triviality

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.

• Type: Conference
• Year: 2004
• Where: IWPEC
• Authors: Jiong Guo, Falk Hüffner, Rolf Niedermeier
• Keywords: Hard Problems, IWPEC 2004, Special Cases, Structural Problem Parameters