Algorithm Theory - SWAT 2004

DOI10.1007/B98413MaRDI QIDQ5315405zbMATH OpenOpenAlexFDO

Authors Paul Medvedev, Joan Boyar

Publication date 7 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98413

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Discrete location and assignment (90B80)

Recommendations

• The relative worst order ratio applied to seat reservation
• Improving the competitive ratios of the seat reservation problem
• The seat reservation problem
• ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS
• scientific article; zbMATH DE number 1696638

Cited in

(17)

• List factoring and relative worst order analysis
• The seat reservation problem
• Separating online scheduling algorithms with the relative worst order ratio
• Comparing online algorithms for bin packing problems
• A new variable-sized bin packing problem
• Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
• scientific article; zbMATH DE number 1696638 (Why is no real title available?)
• A Survey of Algorithms and Models for List Update
• The relative worst order ratio applied to seat reservation
• ON-LINE SEAT RESERVATIONS VIA OFF-LINE SEATING ARRANGEMENTS
• On the Relative Dominance of Paging Algorithms
• Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
• A theoretical comparison of LRU and LRU-K
• The off-line group seat reservation problem
• The relative worst-order ratio applied to paging
• Comparing first-fit and next-fit for online edge coloring
• Scheduling jobs on grid processors

This page was built for publication: Algorithm Theory - SWAT 2004

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315405)