The relative worst order ratio applied to seat reservation

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

Volumn 3111, Issue , 2004, Pages 90-101

  Boyar, Joan ^a   Medvedev, Paul ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS;

COMPETITIVE RATIO; DETERMINISTIC ALGORITHMS; FIRST FIT; ON-LINE ALGORITHMS; SEAT RESERVATION; TICKET PRICES; UNIT PRICES; WORST ORDER RATIO;

ALGORITHMS;

EID: 21144455932     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27810-8_9     Document Type: Article

References (24)

1. B. Awerbuch, Y. Azar, A. Fiat, S. Leonardi and A. Rosén. On-line competitive algorithms for call admission in optical networks. In 4th Annual European Symposium on Algorithms, volume 1136 of LNCS, pages 431-444, 1996.
2. B. Awerbuch, Y. Banal, A. Fiat and A. Rosén. Competitive non-preemptive call control. In 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 312-320, 1994.
3. E. Bach, J. Boyar, L. Epstein, L. M. Favrholdt, T. Jiang, K. S. Larsen, G.-H. Lin, and R. van Stee. Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem. J. Sched., 6:131-147, 2003.
4. A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour and B. Schieber. Bandwidth allocation with preemption. In 27th Annual ACM Symposium on the Theory of Computing, pages 616-625, 1995.
5. S. Ben-David and A. Borodin. A new measure for the study of on-line algorithms. Algorithmica, 11(1):73-91, 1994.
6. J. Boyar and L. M. Favrholdt. The relative worst order ratio for on-line algorithms. In 5th Italian Conference on Algorithms and Complexity, volume 2653 of LNCS, pages 58-69, 2003.
7. J. Boyar and L. M. Favrholdt. The relative worst order ratio for on-line bin packing algorithms. Tech. report PP-2003-13, Department of Mathematics and Computer Science, University of Southern Denmark, Main Campus: Odense University, 2003.
8. J. Boyar, L. M. Favrholdt, and K. S. Larsen. The relative worst order ratio applied to paging. Tech. report ALCOMFT-TR-03-32, Future and Emerging Technologies program under the EU, contract number IST-1999-14186, 2003.
9. J. Boyar, L. M. Favrholdt, K. S. Larsen, and M. N. Nielsen. Extending the accommodating function. Acta Informatica, 40:3-35, 2003.
10. J. Boyar and K. S. Larsen. The seat reservation problem. Algorithmica, 25:403-417, 1999.
11. J. Boyar, K. S. Larsen, and M. N. Nielsen. The accommodating function: A generalization of the competitive ratio. SIAM J. Comput., 31(1):233-258, 2001.
12. L. Epstein, L. M. Favrholdt, and J. S. Kohrt. The relative worst order ratio applied to scheduling problems. Work in progress, 2004.
13. J. A. Garay, I. S. Gopal, S. Kutten, Y. Mansour and M. Yung. Efficient on-line call control algorithms. J. Algorithms, 23:180-194, 1997.
14. R. L. Graham. Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal, 45:1563-1581, 1966.
15. T. R. Jensen and B. Toft. Graph Coloring Problems. John Wiley & Sons, 1995.
16. D.S. Johnson. Fast algorithms for bin packing. Journal of Computer and System Sciences, 8:272-314, 1974.
17. A. R. Karlin, M. S. Manasse, L. Rudolph, and D. D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79-119, 1988.
18. C. Kenyon. Best-Fit bin-packing with random order. In 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 359-364, 1996.
19. H. A. Kierstead and W. T. Trotter. An extremal problem in recursive combinatorics. Congr. Numer., 33:143-153, 1981.
20. J. S. Kohrt. The relative worst order ratio applied to bin coloring. Work in progress, 2004.
21. R. J.Lipton and A.Tomkins. Online interval scheduling. In 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 302-311, 1994.
22. P. Raghavan and E. Upfal. Efficient routing in all-optical networks. In 26th Annual ACM Symposium on the Theory of Computing, pages 134-143, 1994.
23. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Comm. of the ACM, 28(2):202-208, 1985.
24. M. Yannakakis and F. Gavril. The maximum k-colorable subgraph problem for chordal graphs. Information Processing Letters, 24(2):133-137, 1987.