The relative worst order ratio for on-line algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2653, Issue , 2003, Pages 58-69

  Boyar, Joan ^a   Favrholdt, Lene M ^b  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; COMPUTATIONAL COMPLEXITY;

BIN PACKING PROBLEM; COMPETITIVE RATIO; DUAL BIN PACKING; ON-LINE ALGORITHMS; RANDOM ORDER RATIO; STANDARD ALGORITHMS; WORST ORDER RATIO;

ALGORITHMS;

EID: 21144451772     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44849-7_13     Document Type: Article

References (11)

1. Y. Azar, J. Boyar, L. Epstein, L. M. Favrholdt, K. S. Larsen, and M. N. Nielsen. Fair versus Unrestricted Bin Packing. Algorithmica, 34(2):181-196, 2002.
2. S. Ben-David and A. Borodin. A New Measure for the Study of On-Line Algorithms. Algorithmica, 11(1):73-91, 1994.
3. J. Boyar, L. M. Favrholdt, and K. S. Larsen. Work in progress.
4. J. Boyar, K. S. Larsen, and M. N. Nielsen. The Accommodating Function - a Generalization of the Competitive Ratio. SIAM Journal of Computation, 31(1):233-258, 2001.
5. Also in WADS 99, pages 74-79.
6. R. L. Graham. Bounds for Certain Multiprocessing Anomalies. Bell Systems Technical Journal, 45:1563-1581, 1966.
7. D. S. Johnson. Fast Algorithms for Bin Packing. Journal of Computer and System Sciences, 8:272-314, 1974.
8. A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator. Competitive Snoopy Caching. Algorithmica, 3(1):79-119, 1988.
9. C. Kenyon. Best-Fit Bin-Packing with Random Order. In 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 359-364, 1996.
10. E. Koutsoupias and C. H. Papadimitriou. Beyond Competitive Analysis. In 35th Annual Symposium on Foundations of Computer Science, pages 394-400, 1994.
11. D. D. Sleator and R. E. Tarjan. Amortized Efficiency of List Update and Paging Rules. Communications of the ACM, 28(2):202-208, 1985.