bookFeb 2, 2006Closed access

Invitation to Fixed-Parameter Algorithms

Indexed incrossref

Abstract

Abstract This book provides an introduction to the concept of fixed-parameter tractability. The corresponding design and analysis of efficient fixed-parameter algorithms for optimally solving combinatorially explosive (NP-hard) discrete problems is a vividly developing field, with a growing list of applications in various contexts such as network analysis or bioinformatics. The book emphasizes algorithmic techniques over computational complexity theory. It is divided into three parts: a broad introduction that provides the general philosophy and motivation; followed by coverage of algorithmic methods developed over the years in fixed-parameter algorithmics forming the core of the book; and a discussion of the…

Citation impact

1,691
total citations
FWCI
39.24
Percentile
100%
References
314
Citations per year

Authors

1

Topics & keywords

Keywords
  • Parameterized complexity
  • Algorithmics
  • Focus (optics)
  • Computer science
  • Range (aeronautics)
  • Analysis of algorithms
  • Algorithm
  • Parallels
UN Sustainable Development Goals
  • Industry, innovation and infrastructure
No related works found for this paper.