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
- An optimal deterministic algorithm for online \(b\)-matching
- Competitive randomized algorithms for nonuniform problems
- Dependent rounding and its applications to approximation algorithms
- Dynamic TCP acknowledgment and other stories about e/(e-1)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 7053293 (Why is no real title available?)
- scientific article; zbMATH DE number 7053386 (Why is no real title available?)
- Maximum matching in the online batch-arrival model
- On the Advice Complexity of Online Problems
- Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
- Online bipartite matching with unknown distributions
- Online matching and ad allocation
- Online Optimization with Uncertain Information
- Online stochastic reservation systems
- Semi-on-line bin packing: a short overview and a new lower bound
- Semi-online scheduling revisited
Cited in
(3)
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)
