Abstract
The existing literature and the scientific community seem to agree that the main approach to analyze the running time of algorithms and the performance of approximation methods is worst-case analysis. As indicated in Section 1.5 also sound results on the average behaviour of algorithms would be highly appreciated. However, any venture in this direction is bound to run into two major obstacles.
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
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kellerer, H., Pferschy, U., Pisinger, D. (2004). Stochastic Aspects of Knapsack Problems. In: Knapsack Problems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24777-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-24777-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07311-3
Online ISBN: 978-3-540-24777-7
eBook Packages: Springer Book Archive