Sciweavers

MFCS
2004
Springer

Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms

14 years 5 months ago
Ubiquitous Parameterization - Invitation to Fixed-Parameter Algorithms
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of parameterized complexity for computationally hard problems is proving highly fruitful. The purpose of this article is to stir the reader’s interest in this field by providing a gentle
Rolf Niedermeier
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where MFCS
Authors Rolf Niedermeier
Comments (0)