ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS

DOI10.1142/S0129054105003042zbMath1089.90027MaRDI QIDQ5315932

Kim S. Larsen, Jens S. Kohrt

Publication date: 12 September 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

fairnesson-line algorithmschannel-assignment problemseat reservation problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

The relative worst-order ratio applied to paging

Cites Work

• On the complexity of computations under varying sets of primitives
• Extending the accommodating function
• The seat reservation problem
• Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
• The Accommodating Function: A Generalization of the Competitive Ratio
• Union-copy structures and dynamic segment trees
• Bounds on Storage for Consecutive Retrieval

This page was built for publication: ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS