An input sensitive online algorithm for the metric bipartite matching problem

DOI10.1109/FOCS.2017.53MaRDI QIDQ6946334zbMATH OpenFDO

Authors Sharath Raghvendra, Krati Nayyar

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2017.53

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(8)

• The online min-sum set cover problem
• Online deterministic minimum cost bipartite matching with delays on a line
• Online deterministic minimum cost bipartite matching with delays on a line
• Online metric matching on the line with recourse
• Online matching with delays and stochastic arrival times
• Matching on the line admits no \(o(\sqrt{\log n})\)-competitive algorithm
• Stochastic online metric matching: adversarial is no harder than stochastic
• Geometric bipartite matching based exact algorithms for server problems

This page was built for publication: An input sensitive online algorithm for the metric bipartite matching problem

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