The seat reservation problem

Algorithmica (New York)

Volumn 25, Issue 4, 1999, Pages 403-417

  Boyar, J ^a   Larsen, K S ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Accommodating ratio; Competitive ratio; Graph coloring; Interval graphs; On line algorithms; Seat reservation problem

Indexed keywords

EID: 0008781180     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009286     Document Type: Article

References (14)

1. Elias Koutsoupias and Christos H. Papadimitriou. Beyond Competitive Analysis. In Proc. 35th IEEE Symp. on Foundations of Computer Science, pages 394-400, 1994.
2. Allan Borodin, Sandy Irani, Prabhakar Raghavan, and Baruch Schieber. Competitive Paging with Locality of Reference. J. Comput. System Sci., 50:244-258, 1995.
3. Richard M. Karp, Umesh V. Vazirani, and Vijay V. Vazirani. An Optimal Algorithm for On-Line Bipartite Matching. In Proc. 22nd Annual ACM Symp. on Theory of Computing, pages 352-358, 1990.
4. Prabhakar Raghavan and Eli Upfal. Efficient Routing in All-Optical Networks. In Proc. 26th Annual ACM Symp. on Theory of Computing, pages 134-143, 1994.
5. Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, and Adi Rosén. On-Line Competitive Algorithms for Call Admission in Optical Networks. In Proc. Fourth Annual European Symp. on Algorithms, volume 1136 of Lecture Notes in Computer Science, pages 431-444. Springer-Verlag, Berlin, 1996.
6. Juan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, and Moti Yung. Efficient On-Line Call Control Algorithms. J. Algorithms, 23:180-194, 1997.
7. Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, and Baruch Schieber. Bandwidth Allocation with Preemption. In Proc. 27th Annual ACM Symp. on Theory of Computing, pages 616-625, 1995.
8. Richard J. Lipton and Andrew Tomkins. Online Interval Scheduling. In Proc. Fifth Annual ACM-SIAM Symp. on Discrete Algorithms, pages 302-311, 1994.
9. Baruch Awerbuch, Yair Bartal, Amos Fiat, and Adi Rosén. Competitive Non-Preemptive Call Control. In Proc. Fifth Annual ACM-SIAM Symp. on Discrete Algorithms, pages 312-320, 1994.
10. Henry A. Kierstead and William T. Trotter, Jr. An Extremal Problem in Recursive Combinatorics. Congr. Numer., 33:143-153, 1981.
11. Fǎnicǎ Gavril. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph. SIAM J. Comput., 1(2):180-187, 1972.
12. Tommy R. Jensen and Bjarne Toft. Graph Coloring Problems. Wiley, New York, 1995.
13. Anna R. Karlin, Mark S. Manasse, Larry Rudolph, and Daniel D. Sleator. Competitive Snoopy Caching. Algorithmica, 3:79-119, 1988.
14. Shai Ben-David, Allan Borodin, Richard Karp, Gabor Tardos, and Avi Wigderson. On the Power of Randomization in On-Line Algorithms. Algorithmica, 11(1):2-14, 1994.