Approximation Algorithms

  • Juraj Hromkovič
Part of the Texts in Theoretical Computer Science. An EATCS Series book series (TTCS)


Currently, approximation algorithms seem to be the most successful approach for solving hard optimization problems Immediately after introducing NP-hardness (completeness) as a concept for proving the intractability of computing problems, the following question was posed:

“If an optimization problem does not admit any efficient1 algorithm computing an optimal solution, is there a possibility to efficiently compute at least an approximation of the optimal solution?”


Approximation Algorithm Approximation Ratio Minimal Span Tree Knapsack Problem Vertex Cover 
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-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Juraj Hromkovič
    • 1
  1. 1.Department of Computer Science, ETH Zürich, ETH Zentrum RZ F2Swiss Federal Institute of TechnologyZürichSwitzerland

Personalised recommendations