Abstract
IN THE preceding chapter we observed that many relevant optimization problems are Np-hard, and that it is unlikely that we will ever be able to find efficient (i.e., polynomial-time) algorithms for their solution. In such cases it is worth looking for algorithms that always return a feasible solution whose measure is not too far from the optimum.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ausiello, G., Marchetti-Spaccamela, A., Crescenzi, P., Gambosi, G., Protasi, M., Kann, V. (1999). Design Techniques for Approximation Algorithms. In: Complexity and Approximation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58412-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-58412-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63581-6
Online ISBN: 978-3-642-58412-1
eBook Packages: Springer Book Archive