Abstract
Assume that inputs of size 1/4, 2/4, 3/4, or 1 might occur with equal probabilities. If they are put into boxes of size 1 by the strategy best fit, there remains some empty space. This quantity has been evaluated asymptotically for n random insertions.
Discussions with Jean-Marc Steyaert are gratefully acknowledged.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
P.Flajolet and J.Vitter, Average-Case Analysis of Algorithms and Data Structures, in: Handbook of Theoretical Computer Science, North-Holland, to appear 1990.
W. Knödel, Über das mittlere Verhalten von on-line Packungsalgorithmen, EIK 19 (1983), 427–433.
W. Kuich and F. J. Urbanek, Infinite Linear Systems and One Counter Languages, Theor.Comput.Sci. (1983), 95–126.
H. Prodinger, Einige Bemerkungen zu einer Arbeit von W. Knödel über das mittlere Verhalten von on-line-Packungsalgorithmen, EIK 21 (1985), 3–7.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag
About this paper
Cite this paper
Prodinger, H. (1990). Further results on a problem of Knödel concerning the analysis of bin-packing. In: Hlawka, E., Tichy, R.F. (eds) Number-Theoretic Analysis. Lecture Notes in Mathematics, vol 1452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0096990
Download citation
DOI: https://doi.org/10.1007/BFb0096990
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53408-2
Online ISBN: 978-3-540-46864-6
eBook Packages: Springer Book Archive
