Skip to main content
SpringerLink
Log in

An O(n) bin-packing algorithm for uniformly distributed data

Ein O(n)-Bin-Packing-Algorithmus für gleichverteilte Daten

  • Contributed Papers
  • Published:
Computing Aims and scope Submit manuscript

Abstract

We give a first-fit type algorithm, with running timeO(n), for the classical one-dimensional bin-packing problem, and examine it from a probabilistic point of view. Our main result is that the expected waste for this algorithm isO(n 2/3).

Zusammenfassung

Wir geben einen Algorithmus des First-Fit-Typs für das eindimensionale Bin-Packing-Problem an, dessen LaufzeitO(n) ist, und untersuchen ihn aus probabilistischer Sicht. Als Hauptresultat zeigen wir, daß der Erwartungswert für den Fehler unseres AlgorithmusO(n 2/3) ist.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bentley, J. L., Johnson, D. S., Leighton, F. T., McGeoch, C. C., McGeoch, L. A.: Some unexpected expected behavior results for bin-packing. Proc. ACM Symp. on Theory of Computing 279–288 (1984).

  2. Csirik, J.: Bin packing as a random walk: a note on Knödel's paper. To be published.

  3. Frederickson, G. N.: Probabilistic analysis for simple one and two-dimensional bin-packing algorithms. Information Processing Letters11, 156–161 (1980).

    Article  Google Scholar 

  4. Garey, M. R., Johnson, D. S.: Computers and Intractibility: A Guide to the Theory of NP-Completeness. San Francisco: Freeman 1979.

    Google Scholar 

  5. Hoffmann, U.: A class of simple stochastic on-line bin-packing algorithms. Computing29, 227–239 (1982).

    Google Scholar 

  6. Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., Graham, R. L.: Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Computing3, 256–278 (1974).

    Article  Google Scholar 

  7. Knödel, W.: A bin packing algorithm with complexityO(nlogn) and performance 1 in the stochastic limit. Proc. 10th Symp. on Math. Foundations of Comp. Sci. (1981).

  8. Knödel, W.: Über das mittlere Verhalten von On-line Packungs-Algorithmen. Elektr. Inf. und Kybern.19, 427–433 (1983).

    Google Scholar 

  9. Rényi, A.: Wahrscheinlichkeitsrechnung. Berlin: VEB Deutscher Verlag der Wiss. 1962.

    Google Scholar 

Download references

Author information

Author notes

  1. G. Galambos

    Present address: Kalmár Laboratory of Cybernetics, József Attila University, Árpád tér 2, H-6720, Szeged, Hungary

Authors and Affiliations

  1. Department of Computer Science, József Attila University Szeged, Somogyi B. u. 7, H-6720, Szeged, Hungary

    J. Csirik

  2. Lehrstuhl für Angewandte Mathematik II, Universität Augsburg, Memminger Strasse 6, D-8900, Augsburg, Germany

    G. Galambos

Authors
  1. J. Csirik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Galambos
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to Professor W. Knödel on the occasion of his 60th birthday

Rights and permissions

Reprints and permissions

About this article

Cite this article

Csirik, J., Galambos, G. An O(n) bin-packing algorithm for uniformly distributed data. Computing 36, 313–319 (1986). https://doi.org/10.1007/BF02240206

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02240206

Key words

Search

Navigation