Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
From MaRDI portal
Publication:2464382
DOI10.1023/A:1022985808959zbMath1154.90405OpenAlexW1729082581MaRDI QIDQ2464382
Leah Epstein, Eric Bach, Kim S. Larsen, Rob van Stee, Tao Jiang, Lene Monrad Favrholdt, Joan. Boyar, Guo-Hui Lin
Publication date: 20 December 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022985808959
Related Items (4)
Online-bounded analysis ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS ⋮ Online edge coloring of paths and trees with a fixed number of colors
This page was built for publication: Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
