On-line seat reservations via off-line seating arrangements

International Journal of Foundations of Computer Science

Volumn 16, Issue 2, 2005, Pages 381-397

  Kohrt, Jens S ^a   Larsen, Kim S ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

Channel assignment problem; Fairness; On line algorithms; Seat reservation problem

Indexed keywords

EID: 33746228294     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054105003042     Document Type: Conference Paper

References (16)

1. Wilhelm Ackermann. Zum Hilbertschen Aufbau der reellen Zahlen. Mathematische Annalen, 99:118-133, 1928.
2. G. M. Adel'son-Vel'skiǐ and E. M. Landis. An Algorithm for the Organisation of Information. Doklady Akadamii Nauk SSSR, 146:263-266, 1962.
3. In Russian. English translation in Soviet Math. Doklady, 3:1259-1263, 1962.
4. Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, and Rob van Stee. Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. Journal of Scheduling, 6(2):131-147, 2003.
5. Eric Bach, Joan Boyar, Tao Jiang, Kim S. Larsen, and Guo-Hui Lin. Better Bounds on the Accommodating Ratio for the Seat Reservation Problem. In Sixth Annual International Computing and Combinatorics Conference, volume 1858 of Lecture Notes in Computer Science, pages 221-231. Springer-Verlag, 2000.
6. J. L. Bentley. Solutions to Klee's Rectangle Problems. Technical report, Carnegie-Mellon University, 1977.
7. Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2nd edition, 2000.
8. Peter van Emde Boas. Machine Models and Simulations. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 1, pages 1-66. Elsevier Science Publishers, 1990.
9. Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, and Morten N. Nielsen. Extending the Accommodating Function. Ada Informatica, 40(l):3-35, 2003.
10. Joan Boyar and Kim S. Larsen. The Seat Reservation Problem. Algorithmic, 25(4):403-117, 1999.
11. Joan Boyar, Kim S. Larsen, and Morten N. Nielsen. The Accommodating Function: a generalization of the competitive ratio. SIAM Journal on Computing, 31(1):233-258, 2001.
12. David P. Dobkin and Richard J. Lipton. On the Complexity of Computations under Varying Sets of Primitives. Journal of Computer and System Sciences, 18(1):86-91, 1979.
13. Leonidas J. Guibas and Robert Sedgewick. A Dichromatic Framework for Balanced Trees. In 19th Annual IEEE Symposium on the Foundations of Computer Science, pages 8-21, 1978.
14. Udaiprakash I. Gupta, D. T. Lee, and Joseph Y.-T. Leung. An Optimal Solution for the Channel-Assignment Problem. IEEE Transactions on Computers, 28(11):807-810, 1979.
15. Tommy R. Jensen and Bjarne Toft. Graph Coloring Problems. John Wiley & Sons, 1995.
16. Marc J. van Kreveld and Mark H. Overmars. Union-Copy Structures and Dynamic Segment Trees. Journal of the ACM, 40(3):635-652, 1993.