TY - GEN
T1 - On-Line Seat Reservations via Off-Line Seating Arrangements
AU - Frederiksen, Jens S.
AU - Larsen, Kim Skak
PY - 2003
Y1 - 2003
N2 - 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 optimal algorithms to handle problems of this nature.
AB - 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 optimal algorithms to handle problems of this nature.
M3 - Article in proceedings
T3 - Lecture Notes in Computer Science
SP - 174
EP - 185
BT - Algorithms and Data Structures, 8th International Workshop, WADS 2003
T2 - Eighth International Workshop on Algorithms and Data Structures
Y2 - 30 July 2003 through 1 August 2003
ER -