Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Bandwidth allocation with preemption
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Efficient on-line call control algorithms
Journal of Algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On the k-Coloring of Intervals
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
The Accommodating Function - A Generalization of the Competitive Ratio
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
On-line Competive Algorithms for Call Admission in Optical Networks
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Better Bounds on the Accommodating Ratio for the Seat Reservation Problem
Better Bounds on the Accommodating Ratio for the Seat Reservation Problem
The Accommodating Ratio for the Seat Reservation Problem
The Accommodating Ratio for the Seat Reservation Problem
| Hi-index | 0.00 |
In a recent paper [J. Boyar and K.S. Larsen, The seat reservation problem, Algorithmica, 25(1999), 403-417], the seat reservation problem was investigated. It was shown that for the unit price problem, where all tickets have the same price, all "fair" algorithms are at least 1=2-accommodating, while no fair algorithm is more than (4/5+O(1/k))- accommodating, where k is the number of stations the train travels. In this paper, we design a more dextrous adversary argument, such that we improve the upper bound on the accommodating ratio to (7/9+O(1/k)), even for fair randomized algorithms against oblivious adversaries. For deterministic algorithms, the upper bound is lowered to approximately. .7699. It is shown that better upper bounds exist for the special cases with n = 2, 3, and 4 seats. A concrete on-line deterministic algorithm FIRST-FIT and an on-line randomized algorithm RANDOM are also examined for the special case n = 2, where they are shown to be asymptotically optimal.