The seat reservation problem
From MaRDI portal
Publication:1961043
DOI10.1007/PL00009286zbMath0937.68156OpenAlexW1980780254MaRDI QIDQ1961043
Publication date: 17 January 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009286
Related Items (13)
Online-bounded analysis ⋮ Online Multi-Coloring with Advice ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS ⋮ The relative worst-order ratio applied to paging ⋮ Relative Worst-Order Analysis: A Survey ⋮ Online edge coloring of paths and trees with a fixed number of colors ⋮ Online dominating set ⋮ Online Bounded Analysis ⋮ Competitive analysis of the online inventory problem ⋮ Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis ⋮ Competitive Algorithms for Cottage Rental ⋮ Online multi-coloring with advice
This page was built for publication: The seat reservation problem