Minimum Cost Perfect Matching with Delays for Two Sources
From MaRDI portal
Publication:5283368
DOI10.1007/978-3-319-57586-5_18zbMath1407.68557OpenAlexW2607151438MaRDI QIDQ5283368
Yuyi Wang, Yuval Emek, Yaacov Shapiro
Publication date: 21 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_18
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items
Deterministic min-cost matching with delays, Competitive analysis for two variants of online metric matching problem, Impatient Online Matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the advice complexity of online bipartite matching and online stable marriage
- 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
- Paths, Trees, and Flowers
- Maximum matching and a polyhedron with 0,1-vertices