skip to main content
research-article

The relative worst order ratio applied to seat reservation

Published: 22 August 2008 Publication History

Abstract

The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for this problem is studied using the relative worst order ratio, a fairly new measure for the quality of online algorithms, which allows for direct comparisons between algorithms. This study has yielded new separations between algorithms. For example, for both variants of the problem considered, using the relative worst order ratio, First-Fit and Best-Fit are shown to be better than Worst-Fit.

References

[1]
Bach, E., Boyar, J., Epstein, L., Favrholdt, L. M., Jiang, T., Larsen, K. S., Lin, G.-H., and van Stee, R. 2003. Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem. J. Sched. 6, 131--147.
[2]
Ben-David, S., and Borodin, A. 1994. A new measure for the study of online algorithms. Algorithmica 11, 1, 73--91.
[3]
Boyar, J., and Favrholdt, L. M. 2003. The relative worst order ratio for online algorithms. In Proceedings of the 5th Italian Conference on Algorithms and Complexity. Lecture Notes in Computer Science, vol. 2653. 58--69. Extended version in ACM Trans. Algor. 3, 2, 2007.
[4]
Boyar, J., Favrholdt, L. M., and Larsen, K. S. 2007. The relative worst order ratio applied to paging. J. Comput. Syst. Sci. 73, 818--843.
[5]
Boyar, J., Favrholdt, L. M., Larsen, K. S., and Nielsen, M. N. 2003. Extending the accommodating function. Acta Informatica 40, 3--35.
[6]
Boyar, J., and Larsen, K. S. 1999. The seat reservation problem. Algorithmica 25, 403--417.
[7]
Boyar, J., Larsen, K. S., and Nielsen, M. N. 2001. The accommodating function—a generalization of the competitive ratio. SIAM J. Comput. 31, 1, 233--258.
[8]
Boyar, J., and Medvedev, P. 2007. The relative worst order ratio applied to seat reservation. Tech. rep. PP--2007--03, Department of Mathematics and Computer Science, University of Southern Denmark.
[9]
Chrobak, M., and Ślusarek, M. 1988. On some packing problems relating to dynamical storage allocation. RAIRO Theoret. Inform. Appl. 22, 487--499.
[10]
Dorrigiv, R., and López-Ortiz, A. 2005. A survey of performance measures for online algorithms. SIGACT News 36, 3, 1--17.
[11]
Epstein, L., Favrholdt, L. M., and Kohrt, J. S. 2006. Separating online scheduling algorithms with the relative worst order ratio. J. Combin. Optim. 12, 4, 362--385.
[12]
Graham, R. L. 1966. Bounds for certain multiprocessing anomalies. Bell Systems Tech. J. 45, 1563--1581.
[13]
Graham, R. L., Knuth, D. E., and Patashnik, O. 1988. Concrete Mathematics. Equation 5.23. Addison-Wesley.
[14]
Johnson, D. S. 1974. Fast algorithms for bin packing. J. Comput. Syst. Sci. 8, 272--314.
[15]
Karlin, A. R., Manasse, M. S., Rudolph, L., and Sleator, D. D. 1988. Competitive snoopy caching. Algorithmica 3, 1, 79--119.
[16]
Kenyon, C. 1996. Best-fit bin-packing with random order. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. 359--364.
[17]
Kierstead, H. A., and Trotter, W. T. 1981. An extremal problem in recursive combinatorics. Congressus Numerantium 33, 143--153.
[18]
Kohrt, J. S. 2004. Online algorithms under new assumptions. Ph.D. thesis, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark.
[19]
Sleator, D. D., and Tarjan, R. E. 1985. Amortized efficiency of list update and paging rules. Comm. ACM 28, 2, 202--208.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms
ACM Transactions on Algorithms  Volume 4, Issue 4
August 2008
264 pages
ISSN:1549-6325
EISSN:1549-6333
DOI:10.1145/1383369
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 August 2008
Accepted: 01 April 2008
Revised: 01 July 2007
Received: 01 June 2006
Published in TALG Volume 4, Issue 4

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Online
  2. quality measure
  3. relative worst order ratio
  4. seat reservation

Qualifiers

  • Research-article
  • Research
  • Refereed

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)1
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media