Edge-weighted online stochastic matching: beating 1- 1e

DOI10.1137/1.9781611977912.165MaRDI QIDQ6645535zbMATH OpenFDO

Authors

Publication date 28 November 2024

Full work available at URL https://doi.org/10.1137/1.9781611977912.165

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• Online bipartite matching in the probe-commit model
• Online deterministic minimum cost bipartite matching with delays on a line
• Online deterministic minimum cost bipartite matching with delays on a line
• Edge arrival online matching: the power of free disposal on acyclic graphs

This page was built for publication: Edge-weighted online stochastic matching: beating \(1- \frac{1}{e}\)

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