Online algorithms for maximum cardinality matching with edge arrivals
DOI10.4230/LIPICS.ESA.2017.22zbMATH Open1442.68270OpenAlexW2759628670MaRDI QIDQ5111708FDOQ5111708
Authors: Niv Buchbinder, Danny Segev, Yevgeny Tkach 
Publication date: 27 May 2020
Full work available at URL: https://dblp.uni-trier.de/db/conf/esa/esa2017.html#BuchbinderST17
Recommendations
- Online algorithms for maximum cardinality matching with edge arrivals
- Maximum matching in the online batch-arrival model
- Online maximum matching with recourse
- Maximum matching on trees in the online preemptive and the incremental graph models
- Maximum matching on trees in the online preemptive and the incremental dynamic graph models
Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
- AdWords and generalized online matching
- Online matching with concave returns
- Title not available (Why is that?)
- Online Stochastic Matching: Beating 1-1/e
- Online bipartite matching with unknown distributions
- Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
- Online matching and ad allocation
- An optimal deterministic algorithm for online \(b\)-matching
- Online vertex-weighted bipartite matching and single-bid budgeted allocations
- On randomized algorithms for matching in the online preemptive model
- Randomized primal-dual analysis of RANKING for online bipartite matching
- Improved bounds for online preemptive matching
- Online lower bounds via duality
- Two-sided online bipartite matching and vertex cover: beating the greedy algorithm
- Online matroid intersection: beating half for random arrival
- Maximum matching on trees in the online preemptive and the incremental dynamic graph models
Cited In (8)
- Online maximum matching with recourse
- Online algorithms for maximum cardinality matching with edge arrivals
- Online maximum matching with recourse
- Maximum matching on trees in the online preemptive and the incremental dynamic graph models
- Maximum matching on trees in the online preemptive and the incremental graph models
- Maximum Matching in the Online Batch-arrival Model
- Maximum matching in the online batch-arrival model
- Deterministic algorithms for maximum matching on general graphs in the semi-streaming model
This page was built for publication: Online algorithms for maximum cardinality matching with edge arrivals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111708)
