J. Csirik, J. B. G. Frenk, A. Frieze, G. Galambos, and A. H. G. Rinnooy Kan. A probabilistic analysis of the next fit decreasing bin packing heuristic. Oper. Res. Lett., 5:233--236, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Better Approximation Algorithms for Bin Covering - Csirik, Johnson, Kenyon (2001) (1 citation) Self-citation (Csirik) (Correct)
No context found.
J. Csirik, J. B. G. Frenk, A. Frieze, G. Galambos, and A. H. G. Rinnooy Kan. A probabilistic analysis of the next fit decreasing bin packing heuristic. Oper. Res. Lett., 5:233--236, 1986.
Bounded Space On-Line Bin Packing: Best is Better than First - Csirik, Johnson (1991) (1 citation) Self-citation (Csirik) (Correct)
....much more poorly on average than do the NF K . Let L n be a random n item list with item sizes chosen independently from a uniform distribution on [0,1] Then the average value of NF K (L n ) OPT(L n ) empirically approaches 1 as K , whereas the expected ratio for the H K approaches 1.28986. [7,18], and it is reported in [30] that computational experiments suggest that SH K performs just as poorly. The question thus arises whether there exist bounded space on line algorithms that have better worst case ratios than the NF K algorithms and have at least as good average case performance. In ....
....analytically is the question of just what the asymptotic ratios ER u [A] are. Experiments appear to yield reliable estimates, but to date probabilistic analysis has only succeeded with the simplest of algorithms (Next Fit [6,15] Smart Next Fit [23] and variants on the Harmonic algorithms [7,18,24]) Barring exact analysis, can we prove the following conjecture, suggested by our experiments: For any u, 0 u 1, there exists a constant K such that BBF K performs better on average than FF when item sizes are drawn independently and uniformly from the interval (0 , u] Can we even prove ....
J. CSIRIK, J. B. G. FRENK, A. FRIEZE, G. GALAMBOS, AND A. H. G. RINNOOY KAN, "A probabilistic analysis of the next fit decreasing bin packing heuristic," Operations Res. Lett. 5 (1986), 233-236.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC