On the power of advice and randomization for online bipartite matching

DOI10.4230/LIPICS.ESA.2016.37MaRDI QIDQ4606307zbMATH OpenFDO

Authors Christian Konrad, Marc P. Renault, Christoph Dürr

Publication date 2 March 2018

Full work available at URL https://arxiv.org/abs/1602.07154

zbMATH Keywords

randomizationonline algorithmsbipartite matching

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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

(13)

• On the advice complexity of online bipartite matching and online stable marriage
• On extensions of the deterministic online model for bipartite matching and max-sat
• Fully Online Matching with Advice on General Bipartite Graphs and Paths
• Optimal algorithms for online b-matching with variable vertex capacities
• Temporal matching
• Weighted Online Problems with Advice
• A simple PTAS for the dual bin packing problem and advice complexity of its online version
• Online matching in regular bipartite graphs
• Online bin covering with advice
• An Experimental Study of Algorithms for Online Bipartite Matching
• Advice complexity of online non-crossing matching
• Temporal matching on geometric graph data
• The power of multiple choices in online stochastic matching

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)