Best-fit bin-packing with random order

@inproceedings{Kenyon1996BestfitBW,
  title={Best-fit bin-packing with random order},
  author={Claire Kenyon},
  booktitle={SODA '96},
  year={1996}
}
Best-fit is the best known algorithm for on-line binpacking, in the sense that no algorithm is known to behave better both in the worst case (when Best-fit has performance ratio 1.7) and in the average uniform case, with items drawn uniformly in the interval [0, l] (then Best-fit has expected wasted space O(n’/2(log n)“/“)). In practical applications, Best-fit appears to perform within a few percent of optimal. In this paper, in the spirit of previous work in computational geometry, we study… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 88 extracted citations

Similar Papers

Loading similar papers…