The relative worst order ratio applied to seat reservation

Joan Boyar, Paul Medvedev

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

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.

Original languageEnglish (US)
Article number48
JournalACM Transactions on Algorithms
Volume4
Issue number4
DOIs
StatePublished - Aug 1 2008

All Science Journal Classification (ASJC) codes

  • Mathematics (miscellaneous)

Fingerprint Dive into the research topics of 'The relative worst order ratio applied to seat reservation'. Together they form a unique fingerprint.

Cite this