Abstract
IN PREVIOUS chapters the performance of an approximate algorithm has been analyzed using a worst case point of view. In this chapter this condition is relaxed and the probabilistic analysis of an algorithm is performed by considering either the average case or the behavior in almost all cases.
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). Probabilistic analysis of approximation algorithms. In: Complexity and Approximation. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58412-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-58412-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63581-6
Online ISBN: 978-3-642-58412-1
eBook Packages: Springer Book Archive