Improved Bounds for Online Stochastic Matching
From MaRDI portal
Publication:3586460
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Internet topics (68M11) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Recommendations
- Online stochastic matching: new algorithms with better bounds
- Online stochastic matching: new algorithms and bounds
- Improved bounds for randomized preemptive online matching
- Improved bounds for online preemptive matching
- New algorithms, better bounds, and a novel model for online stochastic matching
- Online stochastic weighted matching: improved approximation algorithms
- Improved bounds in stochastic matching and optimization
- Improved bounds in stochastic matching and optimization
- Improved approximation algorithms for stochastic matching
- Online stochastic matching with unequal probabilities
Cited in
(36)- On extensions of the deterministic online model for bipartite matching and max-sat
- Deferred on-line bipartite matching
- A polyhedral approach to online bipartite matching
- Online stochastic matching: new algorithms and bounds
- A stronger impossibility for fully online matching
- Learn from history for online bipartite matching
- Online total bipartite matching problem
- Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts
- Improved online algorithms for jumbled matching
- Online minimum matching with uniform metric and random arrivals
- Advice complexity of online non-crossing matching
- Approximation algorithms for stochastic combinatorial optimization problems
- A dynamic near-optimal algorithm for online linear programming
- The Power of Rejection in Online Bottleneck Matching
- Online stochastic weighted matching: improved approximation algorithms
- Exact Bounds for the Stochastic Upward Matching Problem
- New algorithms, better bounds, and a novel model for online stochastic matching
- Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
- scientific article; zbMATH DE number 7376006 (Why is no real title available?)
- Stochastic online metric matching
- Dynamic Relaxations for Online Bipartite Matching
- Online stochastic matching: new algorithms with better bounds
- Online stochastic matching with unequal probabilities
- Online matching with concave returns
- scientific article; zbMATH DE number 7053386 (Why is no real title available?)
- An Experimental Study of Algorithms for Online Bipartite Matching
- Online 2-stage stable matching
- The power of multiple choices in online stochastic matching
- Online primal dual meets online matching with stochastic rewards: configuration LP to the rescue
- Improved competitive ratio for edge-weighted online stochastic matching
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
- Online stochastic matching with edge arrivals
- Online matching meets sampling without replacement
- A new impossibility result for online bipartite matching problems
- Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching
This page was built for publication: Improved Bounds for Online Stochastic Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586460)
