New algorithms, better bounds, and a novel model for online stochastic matching
From MaRDI portal
Publication:4606293
Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Combinatorial optimization (90C27) Stochastic programming (90C15) Marketing, advertising (90B60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Internet topics (68M11)
Recommendations
Cited in
(18)- An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
- Online vertex-weighted bipartite matching. Beating \(1-\frac{1}{e}\) with random arrivals
- The power of multiple choices in online stochastic matching
- A polyhedral approach to online bipartite matching
- Online stochastic matching: new algorithms with better bounds
- Stochastic Matching with Few Queries: New Algorithms and Tools
- Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts
- scientific article; zbMATH DE number 7740914 (Why is no real title available?)
- scientific article; zbMATH DE number 7376006 (Why is no real title available?)
- Stochastic online metric matching
- Improved analysis of RANKING for online vertex-weighted bipartite matching in the random order model
- Online matching with concave returns
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching
- Advice complexity of online non-crossing matching
- An Experimental Study of Algorithms for Online Bipartite Matching
- Improved Bounds for Online Stochastic Matching
- Special issue: Selected papers based on the presentations at the workshop ``Match-UP: Matching under preferences -- algorithms and complexity, Reykjavík, Iceand, July 2008
- Online stochastic matching: new algorithms and bounds
This page was built for publication: New algorithms, better bounds, and a novel model for online stochastic matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606293)
