Optimization Problems, Approximation Schemes, and Their Relation with FPT

  • R. G. Downey
  • M. R. Fellows
Part of the Monographs in Computer Science book series (MCS)


Optimization problems are at the heart of complexity theory. In practice, we usually wish to optimize some objective function (e.g., find a least-cost tour) rather than solve a related decision problem. Furthermore, even if we demonstrate that some problem has no fast solution, it is often acceptable to find an approximate solution to some desired performance ratio. In this section, we will see that parametric complexity and approximatibility are deeply related.


Maximization Problem Vertex Cover Linear Extension Parameterized Problem Boolean Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • R. G. Downey
    • 1
  • M. R. Fellows
    • 2
  1. 1.Department of MathematicsVictoria University, WellingtonWellingtonNew Zealand
  2. 2.Department of Computer ScienceUniversity of Victoria, VictoriaVictoriaCanada

Personalised recommendations