A Structural View on Parameterizing Problems: Distance from Triviality [chapter]

Jiong Guo, Falk Hüffner, Rolf Niedermeier
2004 Lecture Notes in Computer Science  
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
more » ... terizations (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.
doi:10.1007/978-3-540-28639-4_15 fatcat:2oemfxdjpre35b4fou62izyxgu