Edge-Weighted Online Windowed Matching

DOI10.1287/MOOR.2022.1289MaRDI QIDQ6199281zbMATH OpenOpenAlexFDO

Authors Itai Ashlagi, Maximilien Burq, Chinmoy Dutta, Patrick Jaillet, Amin Saberi

Publication date 23 February 2024

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.2022.1289

zbMATH Keywords

adversarial arrivalsbatchingedge-weighted online matchingnonbipartite matchingonline matching algorithmsrandom order arrivalswindowed matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Cited in

(4)

• Deterministic primal-dual algorithms for online k-way matching with delays
• Deterministic primal-dual algorithms for online \(k\)-way matching with delays
• Online matching on 3-uniform hypergraphs
• Edge arrival online matching: the power of free disposal on acyclic graphs

This page was built for publication: Edge-Weighted Online Windowed Matching

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