Abstract
IN THE PRECEDING chapters the problem of computing good solutions for Np-hard optimization problems has always been considered in terms of deriving algorithms with a guaranteed behaviour, where such a guarantee refers both to the quality of the returned solution (in terms of either worst case or expected performance ratio) and to the running time (polynomial either in the worst or in the average case).
This is a preview of subscription content, log in via an institution to check access.
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). Heuristic methods. In: Complexity and Approximation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58412-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-58412-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63581-6
Online ISBN: 978-3-642-58412-1
eBook Packages: Springer Book Archive