Improving the competitive ratios of the seat reservation problem

3Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In the seat reservation problem, there are k stations, s1 through sk, and one train with n seats departing from the station s1 and arriving at the station sk. Each passenger orders a ticket from station si to station sj (1 ≤ i

Cite

CITATION STYLE

APA

Miyazaki, S., & Okamoto, K. (2010). Improving the competitive ratios of the seat reservation problem. IFIP Advances in Information and Communication Technology, 323 AICT, 328–339. https://doi.org/10.1007/978-3-642-15240-5_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free