Improved Bounds in Stochastic Matching and Optimization
From MaRDI portal
Publication:5351894
DOI10.4230/LIPIcs.APPROX-RANDOM.2015.124zbMath1375.90228OpenAlexW2275985831MaRDI QIDQ5351894
Aravind Srinivasan, Amit Chavan, Andrei Nikiforov, Alok Baveja, Pan Xu
Publication date: 31 August 2017
Full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.124
Stochastic programming (90C15) Hypergraphs (05C65) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items (4)
Approximation algorithms for stochastic combinatorial optimization problems ⋮ Unnamed Item ⋮ Attenuate locally, win globally: attenuation-based frameworks for online stochastic matching with timeouts ⋮ Unnamed Item
This page was built for publication: Improved Bounds in Stochastic Matching and Optimization
