Minimum cost perfect matching with delays for two sources
DOI10.1016/J.TCS.2018.07.004zbMATH Open1407.68558OpenAlexW2883104186WikidataQ129508123 ScholiaQ129508123MaRDI QIDQ1628601FDOQ1628601
Authors: Yuval Emek, Yaacov Shapiro, Yuyi Wang 
Publication date: 4 December 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.07.004
Recommendations
- Minimum cost perfect matching with delays for two sources
- Min-cost bipartite perfect matching with delays
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
- The minimum cost perfect matching problem with conflict pair constraints
- Two improved formulations for the minimum latency problem
- On the minimum delay problem
- A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program
- scientific article; zbMATH DE number 4133845
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
- Online vertex-weighted bipartite matching and single-bid budgeted allocations
- Online Weighted Matching
- On the advice complexity of online bipartite matching and online stable marriage
- Randomized primal-dual analysis of RANKING for online bipartite matching
- Randomized online algorithms for minimum metric bipartite matching
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
- Min-cost bipartite perfect matching with delays
- Online matching: haste makes waste!
Cited In (5)
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 Q1628601)
