Impatient Online Matching
From MaRDI portal
Publication:5091056
DOI10.4230/LIPIcs.ISAAC.2018.62OpenAlexW2893807579MaRDI QIDQ5091056
Xingwu Liu, Roger Wattenhofer, Zhida Pan, Yuyi Wang
Publication date: 21 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.ISAAC.2018.62
Related Items (1)
Cites Work
- On the advice complexity of online bipartite matching and online stable marriage
- Competitive randomized algorithms for nonuniform problems
- On-line algorithms for weighted bipartite matching and stable marriages
- Bayesian Mechanism Design
- AdWords and generalized online matching
- Randomized online algorithms for minimum metric bipartite matching
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
- Online Weighted Matching
- Online service with delay
- Min-Cost Bipartite Perfect Matching with Delays
- Minimum Cost Perfect Matching with Delays for Two Sources
- Paths, Trees, and Flowers
- Online matching: haste makes waste!
- Maximum matching and a polyhedron with 0,1-vertices
- Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching
- Unnamed Item
- Unnamed Item
This page was built for publication: Impatient Online Matching
