Extending the accommodating function

Acta Informatica

Volumn 40, Issue 1, 2003, Pages 3-35

  Boyar, Joan ^a   Favrholdt, Lene M ^a   Larsen, Kim S ^a   Nielsen, Morten N ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITIVE RATIO; OFF-LINE ALGORITHM; OFF-LINE PERFORMANCE; ON-LINE ALGORITHMS; ON-LINE PERFORMANCE; ONLINE PROBLEMS; QUALITY MEASURES; RESOURCE-BOUNDED;

OPTIMIZATION;

ALGORITHMS;

EID: 3042724582     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/s00236-003-0124-9     Document Type: Review

References (24)

1. Y. Azar, J. Boyar, L. Epstein, L.M. Favrholdt, K.S. Larsen, M.N. Nielsen. Fair versus Unrestricted Bin Packing. Algorithmica 34(2): 181-196, 2002
2. Y. Azar, L. Epstein, R. van Stee. Resource augmentation in load balancing. Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, vol. 1851 of Lecture Notes in Computer Science, pp 189-199. Berlin Heidelberg New York: Springer 2000
3. E. Bach, J. Boyar, L. Epstein, L.M. Favrholdt, T. Jiang, K.S. Larsen, G.-H. Lin, R. van Stee. Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem. Journal of Scheduling 6(2): 131-147, 2003
4. S. Ben-David, A. Borodin. A new measure for the study of on-line algorithms. Algorithmica 11(1): 73-91, 1994
5. A. Borodin, R. El-Yaniv. Online computation and competitive analysis. Cambridge: Cambridge University Press 1998
6. A. Borodin, S. Irani, P. Raghavan, B. Schieber. Competitive paging with locality of reference. Journal of Computer and System Sciences 50(2): 244-258, 1995.
7. Also in STOC 91, pp. 249-259
8. J. Boyar, K.S. Larsen. The seat reservation problem. Algorithmica 25: 403-417, 1999
9. J. Boyar, K.S. Larsen, M.N. Nielsen. The accommodating function: a generalization of the competitive ratio. SIAM Journal on Computing 31(1): 233-258, 2001
10. M. Brehop, E. Torng, P. Uthaisombut. Applying extra resource analysis to load balancing. Journal of Scheduling 3: 273-288 2000
11. M. Chrobak, H. Karloff, T. Payne, S. Vishwanathan. New results on server problems. SIAM Journal on Discrete Mathematics 4(2): 172-181, 1991
12. M. Chrobak, M. Ślusarek. On some packing problems related to dynamic storage allocation. RAIRO Informatique Théoretique et Applications 22: 487-499, 1988
13. R.L. Graham. Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal 45: 1563-1581, 1966
14. T.R. Jensen, B. Toft. Graph coloring problems. New York: John Wiley & Sons 1995
15. B. Kalyanasundaram, K. Pruhs. Speed is as powerful as clairvoyance. In Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, pp 214-221, 1995
16. C. Kenyon. Best-fit bin-packing with random order. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 359-364, 1996
17. H.A. Kierstead, J. Qin. Coloring interval graphs with First-Fit. Discrete Mathematics 144:47-57 (1995)
18. H.A. Kierstead, W.T. Trotter. An extremal problem in recursive combinatorics. Congressus Numerantium 33: 143-153, 1981
19. E. Koutsoupias. Weak adversaries for the k-server problem. Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 444-449, 1999
20. E. Koutsoupias, C.H. Papadimitriou. Beyond competitive analysis. 35th Annual Symposium on Foundations of Computer Science, pp. 394-400, 1994
21. M.S. Manasse, L.A. McGeoch, D.D. Sleator. Competitive algorithms for server problems. Journal of Algorithms 11(2): 208-230, 1990
22. D.D. Sleator, R.E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM 28(2): 202-208, 1985
23. N. Young. On-line caching as cache size varies. Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms pp. 241-250, 1991
24. N E. Young. On-line file caching. Ninth Annual ACM-SLAM Symposium on Discrete Algorithms, pp. 82-86, 1998