On-Line Bin Packing in Linear Time

@article{Ramanan1989OnLineBP,
  title={On-Line Bin Packing in Linear Time},
  author={Prakash V. Ramanan and Donna J. Brown and C. C. Lee and D. T. Lee},
  journal={J. Algorithms},
  year={1989},
  volume={10},
  pages={305-326}
}
In this paper, we study the l-dimensional on-line bin packing problem. A list of pieces, each of size between zero and unity are to be packed, in order of their arrival, into a minimum number of unit-capacity bins. We present a new linear-time algorithm, the Modified Harmonic Algorithm and show, by a novel use of weighting functions, that it has an asymptotic worst-case performance ratio less than ! + : + & = 1.(615)*. We show that for a large class of linear-time on-line algorithms including… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Approximation algorithms for bin packing-An updated survey, in “Algorithm Design for Computer System Design

D. J. BROWN, draft, +3 authors D. S. JOHNSON
1984

BROWN AND P. RAMANAN, On-line bin-packing in linear time, in “Proceed

D J.
1980

New algorithms for bin packing

C YAOA.
J. Assoc. Comput. Much • 1980

Fast algorithms for bin packing

D. S. JOHNSON
J. Comput. System Sci • 1974

Reducibility among combinatorial problems , in “ Complexity of Computer Computations ”

J. W. Thatcher
J . Comput . System Sci . SIAM J . Comput . • 1974

Similar Papers

Loading similar papers…