Author:
Boyar Joan,Favrholdt Lene M.,Larsen Kim S.,Nielsen Morten N.
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Y. Azar, J. Boyar, L. Epstein, L. M. Favrholdt, K. S. Larsen, and M. N. Nielsen. Fair versus Unrestricted Bin Packing. Algorithmica. To appear. Preliminary version in SWAT 2000.
2. Lect Notes Comput Sci;Y. Azar,2000
3. E. Bach, J. Boyar, L. Epstein, L. M. Favrholdt, T. Jiang, K. S. Larsen, G.-H. Lin, and R. van Stee. Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. Journal of Scheduling. To appear. Preliminary version in COCOON 2000.
4. J. Boyar, L. M. Favrholdt, K. S. Larsen, and M. N. Nielsen. Extending the Accommodating Function. Technical report PP-2002-02, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, 2002.
5. J. Boyar and K. S. Larsen. The Seat Reservation Problem. Algorithmica, 25:403–417, 1999.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Online Seat Reservations via Offline Seating Arrangements;Lecture Notes in Computer Science;2003
2. Seat Reservation Allowing Seat Changes;Electronic Notes in Theoretical Computer Science;2001-08