A match in time saves nine: deterministic online matching with delays

DOI10.1007/978-3-319-89441-6_11zbMath1504.68288arXiv1704.06980OpenAlexW2963074526MaRDI QIDQ1644933

Paweł Schmidt, Marcin Bienkowski, Artur Kraska

Publication date: 22 June 2018

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

zbMATH Keywords

competitive analysisdelaysonline matchingrent-or-buy

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Related Items (5)

Unnamed Item ⋮ On bin packing with clustering and bin packing with delays ⋮ Permutation Strikes Back: The Power of Recourse in Online Metric Matching ⋮ Deterministic min-cost matching with delays ⋮ Competitive analysis for two variants of online metric matching problem

This page was built for publication: A match in time saves nine: deterministic online matching with delays