Better Bounds on the Accommodating Ratio for the Seat Reservation Problem-Reference-Cited by-同舟云学术

Better Bounds on the Accommodating Ratio for the Seat Reservation Problem

Published:2000 Issue: Volume: Page:221-231
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bach Eric,Boyar Joan,Jiang Tao,Larsen Kim S.,Lin Guo-Hui

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44968-X_22

Reference15 articles.

1. Lect Notes Comput Sci;B. Awerbuch,1996

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 allocation with preemption, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC’95), 1995, pp. 616–625.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimisation of seat reservations on trains to minimise transfer distances;Operational Research;2023-07-17

2. Online Seat Reservations via Offline Seating Arrangements;Lecture Notes in Computer Science;2003

3. Extending the Accommodating Function;Lecture Notes in Computer Science;2002

4. Better Bounds on the Accommodating Ratio for the Seat Reservation Problem;Lecture Notes in Computer Science;2000