Abstract
RANDOMIZATION IS one of the most interesting and useful tools in designing efficient algorithms. Randomized algorithms, indeed, have been proposed for many problems arising in different areas: taking into account the scope of this book, however, we will limit ourselves to considering randomized approximation algorithms for Np-hard optimization problems.
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). Approximation through Randomization. In: Complexity and Approximation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58412-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-58412-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63581-6
Online ISBN: 978-3-642-58412-1
eBook Packages: Springer Book Archive