论文信息 - On-line seat reservations via off-line seating arrangements

On-line seat reservations via off-line seating arrangements

When reservations are made to for instance a train, it is an on-line problem to accept or reject, i.e., decide if a person can be fitted in given all earlier reservations. However, determining a seating arrangement, implying that it is safe to accept, is an off-line problem with the earlier reservations and the current one as input. We develop algorithms with optimal running time to handle problems of this nature.

Kim S. Larsen | Jens S. Kohrt

[1] Joan Boyar,et al. The Seat Reservation Problem , 1999, Algorithmica.

[2] Leonidas J. Guibas,et al. A dichromatic framework for balanced trees , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[3] Mark H. Overmars,et al. Union-copy structures and dynamic segment trees , 1993, JACM.

[4] Tao Jiang,et al. Better Bounds on the Accommodating Ratio for the Seat Reservation Problem , 1997, COCOON.

[5] Joan Boyar,et al. Extending the Accommodating Function , 2002, COCOON.

[6] P. Boas. Machine models and simulations , 1991 .

[7] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .

[8] Tommy R. Jensen,et al. Graph Coloring Problems , 1994 .

[9] Peter van Emde Boas,et al. Machine Models and Simulation , 1990, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[10] Tao Jiang,et al. Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem , 2003, J. Sched..

[11] W. Ackermann. Zum Hilbertschen Aufbau der reellen Zahlen , 1928 .

[12] Joseph Y.-T. Leung,et al. An Optimal Solution for the Channel-Assignment Problem , 1979, IEEE Transactions on Computers.

[13] Joan Boyar,et al. The Accommodating Function: A Generalization of the Competitive Ratio , 2001, SIAM J. Comput..

[14] Richard J. Lipton,et al. On the Complexity of Computations under Varying Sets of Primitives , 1975, J. Comput. Syst. Sci..