Galambos and Frenk, A simple proof of Liang's lower bound for on-line packing and the extension to the parametric case, Discrete Applied Math, 41, 1993, 173178.  Home/Search   Document Not in Database   Summary   Related Articles

.... lower performance ratios; the current best performance ratio is 1:58 : 16] The quest for better algorithms was somewhat quelched by Yao s lower bound: no deterministic on line algorithm can have performance ratio better than 1:5 [19] This lower bound was later improved up to 1:54 : in [13, 6, 18], and proved to hold even for randomized algorithms [1] The performance ratio has the drawback that for Best fit, the worst case sequences upon which it relies are very contrived and never occur in practice. These sequences are contrived in two ways: on the one hand, the values of the items ....

Galambos and Frenk, A simple proof of Liang's lower bound for on-line packing and the extension to the parametric case, Discrete Applied Math, 41, 1993, 173178.

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