On the power of advice and randomization for online bipartite matching
From MaRDI portal
Publication:4606307
Recommendations
- Online matching in regular bipartite graphs
- Fully Online Matching with Advice on General Bipartite Graphs and Paths
- On the advice complexity of online bipartite matching and online stable marriage
- Randomization can be as helpful as a glimpse of the future in online computation
- On the power of randomness versus advice in online computation
Cited in
(12)- Temporal matching on geometric graph data
- The power of multiple choices in online stochastic matching
- Temporal matching
- On the advice complexity of online bipartite matching and online stable marriage
- Online matching in regular bipartite graphs
- Weighted Online Problems with Advice
- Advice complexity of online non-crossing matching
- Fully Online Matching with Advice on General Bipartite Graphs and Paths
- An Experimental Study of Algorithms for Online Bipartite Matching
- On extensions of the deterministic online model for bipartite matching and max-sat
- Online bin covering with advice
- A simple PTAS for the dual bin packing problem and advice complexity of its online version
This page was built for publication: On the power of advice and randomization for online bipartite matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606307)