Semi-online bipartite matching
From MaRDI portal
Publication:5090428
DOI10.4230/LIPICS.ITCS.2019.50MaRDI QIDQ5090428FDOQ5090428
Authors: Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, Erik Vee 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1812.00134
Recommendations
- Deferred on-line bipartite matching
- Online bipartite matching with unknown distributions
- Online matching in regular bipartite graphs
- Near optimal algorithms for online weighted bipartite matching in adversary model
- Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
Cites Work
- Title not available (Why is that?)
- Semi-on-line bin packing: a short overview and a new lower bound
- On the Advice Complexity of Online Problems
- Semi-online scheduling revisited
- Competitive randomized algorithms for nonuniform problems
- Dependent rounding and its applications to approximation algorithms
- 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
- Title not available (Why is that?)
- Online stochastic reservation systems
- Dynamic TCP acknowledgment and other stories about \(e/(e-1)\)
- Title not available (Why is that?)
- Online Optimization with Uncertain Information
- Maximum matching in the online batch-arrival model
Cited In (1)
This page was built for publication: Semi-online bipartite matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090428)
