A primal-dual online deterministic algorithm for matching with delays

DOI10.1007/978-3-030-04693-4_4OpenAlexW2963149936MaRDI QIDQ1757757

Hsiang-Hsuan Liu, Paweł Schmidt, Marcin Bienkowski, Artur Kraska

Publication date: 15 January 2019

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

zbMATH Keywords

competitive analysisonline algorithmsprimal-dual algorithmsmetric matchingdelayed service

Mathematics Subject Classification ID

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

Related Items (4)

Unnamed Item ⋮ The power of amortized recourse for online graph problems ⋮ Deterministic min-cost matching with delays ⋮ Competitive analysis for two variants of online metric matching problem

This page was built for publication: A primal-dual online deterministic algorithm for matching with delays