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?”
KeywordsAssure limE Prefix Sudan Veri
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 2004