Online matching with set and concave delays

DOI10.4230/LIPICS.APPROX/RANDOM.2023.17MaRDI QIDQ6663028zbMATH OpenFDO

Authors Lindsey Deryckere, Seeun William Umboh

Publication date 14 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2023.17

zbMATH Keywords

delaymatchingnon-clairvoyantonline algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(8)

• Universal optimization for non-clairvoyant subadditive joint replenishment
• Online deterministic minimum cost bipartite matching with delays on a line
• Online deterministic minimum cost bipartite matching with delays on a line
• Online matching with delays and stochastic arrival times
• Universal optimization for non-clairvoyant subadditive joint replenishment
• Online multi-level aggregation with delays and stochastic arrivals
• Online matching with delays and size-based costs
• Nearly-optimal algorithm for non-clairvoyant service with delay

This page was built for publication: Online matching with set and concave delays

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