Stochastic Online Metric Matching
From MaRDI portal
Publication:5091225
DOI10.4230/LIPIcs.ICALP.2019.67OpenAlexW2965135159MaRDI QIDQ5091225
Anupam Gupta, Binghui Peng, David Wajc, Guru Prashanth Guruganesh
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1904.09284
Related Items (4)
Online minimum matching with uniform metric and random arrivals ⋮ Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm ⋮ Unnamed Item ⋮ Permutation Strikes Back: The Power of Recourse in Online Metric Matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On-line algorithms for weighted bipartite matching and stable marriages
- Dispatch: an optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
- A sharp estimate of the binomial mean absolute deviation with applications
- The Online Metric Matching Problem for Doubling Metrics
- Set Covering with Our Eyes Closed
- Bayesian Mechanism Design
- A $$o(n)$$-Competitive Deterministic Algorithm for Online Matching on a Line
- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching
- AdWords and generalized online matching
- Randomized online algorithms for minimum metric bipartite matching
- Improved Bounds for Online Stochastic Matching
- A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching
- Online Weighted Matching
- Online Stochastic Matching: Beating 1-1/e
- How to match when all vertices arrive online
- Tight Competitive Ratios of Classic Matching Algorithms in the Fully Online Model
- Online bipartite matching with unknown distributions
- Online bipartite matching with random arrivals
- Probability and Computing
- A tight bound on approximating arbitrary metrics by tree metrics
This page was built for publication: Stochastic Online Metric Matching
