Better bounds on the accommodating ratio for the seat reservation problem

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

Volumn 1858, Issue , 2000, Pages 221-231

  Bach, Eric ^a   Boyar, Joan ^b   Jiang, Tao ^c,d   Larsen, Kim S ^b   Lin, Guo Hui ^d,e  

^a University of Wisconsin   (United States)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^c University of California ^*  (United States)

^d MCMASTER UNIVERSITY   (Canada)

^e UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ADVERSARY ARGUMENT; ASYMPTOTICALLY OPTIMAL; DETERMINISTIC ALGORITHMS; FAIR ALGORITHM; OBLIVIOUS ADVERSARIES; RANDOMIZED ALGORITHMS; SEAT RESERVATION; TRAIN TRAVEL;

COMBINATORIAL MATHEMATICS;

EID: 0008788634     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44968-x_22     Document Type: Conference Paper

References (15)

1. B. Awerbuch, Y. Bartal, A. Fiat, S. Leonardi and A. Rosén, On-line competitive algorithms for call admission in optical networks, in Proceedings of the 4th Annual European Symposium on Algorithms (ESA’96), LNCS 1136, 1996, pp. 431-444.
2. B. Awerbuch, Y. Bartal, A. Fiat and A. Rosén, Competitive non-preemptive call control, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’94), 1994, pp. 312-320.
3. E. Bach, J. Boyar, T. Jiang, K.S. Larsen and G.-H. Lin, Better bounds on the accommodating ratio for the seat reservation problem, PP-2000-8, Department of Mathematics and Computer Science, University of Southern Denmark (2000).
4. E. Bach, J. Boyar and K.S. Larsen, The accommodating ratio for the seat reservation problem, PP-1997-25, Department of Mathematics and Computer Science, University of Southern Denmark, May, 1997.
5. A. Bar-Noy, R. Canetti, S. Kutten, Y. Mansour and B. Schieber, Bandwidth al-location with preemption, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC’95), 1995, pp. 616-625.
6. J. Boyar and K.S. Larsen, The seat reservation problem, Algorithmica, 25(4) (1999), 403-417.
7. J. Boyar, K.S. Larsen and M.N. Nielsen, The accommodating function - a generalization of the competitive ratio, in Proceedings of the Sixth International Workshop on Algorithms and Data Structures (WADS’99), LNCS 1663, 1999, pp. 74-79.
8. M.C. Carlisle and E.L. Lloyd, On the k-coloring of intervals, in Advances in Computing and Information - ICCI’91, LNCS 497, 1991, pp. 90-101.
9. J.A. Garay, I.S. Gopal, S. Kutten, Y. Mansour and M. Yung, Efficient on-line call control algorithms, Journal of Algorithms, 23 (1997) 180-194.
10. F. Gavril, Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph, SIAM Journal on Computing, 1(2) (1972), 180-187.
11. T.R. Jensen and B. Toft, Graph coloring problems, Wiley, New York, 1995.
12. H.A. Kierstead and W.T. Trotter, Jr., An extremal problem in recursive combinatorics. Congressus Numerantium, 33 (1981) 143-153.
13. R.J. Lipton and A. Tomkins, On-line interval scheduling, in Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’94), 1994, pp. 302-311.
14. P. Raghavan and E. Upfal, Efficient routing in all-optical networks, in Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC’94), 1994, pp. 134-143.
15. L. Van Wassenhove, L. Kroon and M. Salomon, Exact and approximation algorithms for the operational fixed interval scheduling problem, Working paper 92/08/TM, INSEAD, Fontainebleau, France, 1992.