Scheduling appointments online: the power of deferred decision-making

DOI10.1007/978-3-031-18367-6_5arXiv2111.13986OpenAlexW3215234994MaRDI QIDQ6176552

Devin Smedira, David B. Shmoys

Publication date: 25 July 2023

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.13986

zbMATH Keywords

competitive analysisonline algorithmbin packingprimal-dual algorithm

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Does randomization help in on-line bin packing?
• The optimal absolute ratio for online bin packing
• Fast algorithms for bin packing
• Algorithmic graph theory and perfect graphs
• Lower bounds on the performance of online algorithms for relaxed packing problems
• A simple on-line bin-packing algorithm
• A new lower bound for classic online bin packing

This page was built for publication: Scheduling appointments online: the power of deferred decision-making