Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
From MaRDI portal
Publication:5111708
DOI10.4230/LIPIcs.ESA.2017.22zbMath1442.68270OpenAlexW2759628670MaRDI QIDQ5111708
Niv Buchbinder, Yevgeny Tkach, Danny Segev
Publication date: 27 May 2020
Full work available at URL: https://dblp.uni-trier.de/db/conf/esa/esa2017.html#BuchbinderST17
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Online algorithms; streaming algorithms (68W27)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- An optimal deterministic algorithm for online \(b\)-matching
- Online matroid intersection: beating half for random arrival
- Maximum matching on trees in the online preemptive and the incremental dynamic graph models
- Bayesian Mechanism Design
- Online Stochastic Matching: Online Actions Based on Offline Statistics
- Improved Bounds for Online Preemptive Matching
- Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm
- On Randomized Algorithms for Matching in the Online Preemptive Model
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- AdWords and generalized online matching
- Online Lower Bounds via Duality
- Online Stochastic Matching: Beating 1-1/e
- Online matching with concave returns
- Online bipartite matching with unknown distributions
- Online bipartite matching with random arrivals
- Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching
This page was built for publication: Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
