Seat reservation allowing seat changes☆
References (13)
- et al.
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
J. Sched.
(2003) - et al.
Fair versus unrestricted bin packing
Nordic J. Comput.
(2001) - et al.
Extending the accommodating function
Acta Informatica
(2003) - J. Boyar, S. Krarup, M.N. Nielsen, Seat reservation allowing seat changes, Preprint PP–2002–06, Department of Computer...
- et al.
The seat reservation problem
Algorithmica
(1999) - et al.
The accommodating function: a generalization of the competitive ratio
SIAM J. Comput.
(2001)
There are more references available in the full text version of this article.
Cited by (0)
- ☆
A preliminary version of some of these results was presented at Workshop on Algorithmic Methods and Models for Optimization of Railways, ATMOS 2001, and appeared in: Proceedings of the Satellite Workshops of the 28th International Colloquium on Automata, Languages, and Programming, in: Electronic Notes in Theoretical Computer Science, vol. 50, Elsevier, 2001, pp. 26–40.
- 1
Supported in part by the Danish Natural Science Research Council (SNF) and in part by the Future and Emerging Technologies program of the EU under contract number IST-1999-14186 (alcom-ft).
Copyright © 2004 Elsevier Inc. All rights reserved.