scientific article; zbMATH DE number 6850371
From MaRDI portal
Publication:4607945
Recommendations
- Online matching in regular bipartite graphs
- Online Matching in Regular Bipartite Graphs with Randomized Adversary
- Markovian online matching algorithms on large bipartite random graphs
- On randomized algorithms for matching in the online preemptive model
- Online stochastic matching: new algorithms and bounds
- scientific article; zbMATH DE number 1033855
- Online stochastic matching: new algorithms with better bounds
- Random matchings in regular graphs
- Online maximum matching with recourse
Cited in
(17)- Online minimum matching with uniform metric and random arrivals
- Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
- Online Matching in Regular Bipartite Graphs with Randomized Adversary
- Improved competitive ratio for edge-weighted online stochastic matching
- Online allocation and display ads optimization with surplus supply
- Markovian online matching algorithms on large bipartite random graphs
- Online Edge Coloring via Tree Recurrences and Correlation Decay
- scientific article; zbMATH DE number 7376006 (Why is no real title available?)
- Stochastic online metric matching
- Online matching in regular bipartite graphs
- scientific article; zbMATH DE number 7650074 (Why is no real title available?)
- Improved bounds for randomized preemptive online matching
- Max-min greedy matching problem: hardness for the adversary and fractional variant
- Max-min greedy matching
- Max-min greedy matching problem: hardness for the adversary and fractional variant
- On randomized algorithms for matching in the online preemptive model
- Improved bounds for online preemptive matching
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607945)
