International Symposium on Mathematical Foundations of Computer Science

MFCS 2004: Mathematical Foundations of Computer Science 2004 pp 84-103

Ubiquitous Parameterization — Invitation to Fixed-Parameter Algorithms

  • Rolf Niedermeier
Conference paper

DOI: 10.1007/978-3-540-28629-5_4

Volume 3153 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Niedermeier R. (2004) Ubiquitous Parameterization — Invitation to Fixed-Parameter Algorithms. In: Fiala J., Koubek V., Kratochvíl J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg

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 introduction to the rewarding field of fixed-parameter algorithms.

Keywords

NP-hardness parameterized complexity fixed-parameter algorithms parameterization 

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

  • Rolf Niedermeier
    • 1
  1. 1.Wilhelm-Schickard-Institut für InformatikUniversität TübingenTübingenGermany