Minimum cost perfect matching with delays for two sources
DOI10.1007/978-3-319-57586-5_18zbMATH Open1407.68557OpenAlexW2607151438MaRDI QIDQ5283368FDOQ5283368
Authors: Yuval Emek, Yaacov Shapiro, Yuyi Wang 
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
Recommendations
Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- On-line algorithms for weighted bipartite matching and stable marriages
- AdWords and generalized online matching
- Maximum matching and a polyhedron with 0,1-vertices
- Title not available (Why is that?)
- Online matching and ad allocation
- Title not available (Why is that?)
- Online Weighted Matching
- On the advice complexity of online bipartite matching and online stable marriage
- Randomized online algorithms for minimum metric bipartite matching
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
Cited In (7)
- Deterministic min-cost matching with delays
- Minimum cost perfect matching with delays for two sources
- Randomized algorithm for MPMD on two sources
- Impatient Online Matching
- Competitive analysis for two variants of online metric matching problem
- Capacity-insensitive algorithms for online facility assignment problems on a line
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
This page was built for publication: Minimum cost perfect matching with delays for two sources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283368)
