Stochastic Covering and Adaptivity
From MaRDI portal
Publication:3525789
DOI10.1007/11682462_50zbMath1145.90427OpenAlexW1605455774MaRDI QIDQ3525789
Michel X. Goemans, Jan Vondrák
Publication date: 18 September 2008
Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11682462_50
Analysis of algorithms and problem complexity (68Q25) Stochastic programming (90C15) Approximation algorithms (68W25)
Related Items (13)
Ignorant vs. Anonymous Recommendations ⋮ Submodular Stochastic Probing on Matroids ⋮ Adaptivity in the stochastic blackjack knapsack problem ⋮ Set selection under explorable stochastic uncertainty via covering techniques ⋮ Adaptivity gaps for the stochastic Boolean function evaluation problem ⋮ Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem ⋮ Scenario-based learning for stochastic combinatorial optimisation ⋮ Stochastic set packing problem ⋮ Robust budget allocation via continuous submodular functions ⋮ Risk averse submodular utility maximization ⋮ On competitive recommendations ⋮ Unnamed Item ⋮ A Tight Bound for Stochastic Submodular Cover
This page was built for publication: Stochastic Covering and Adaptivity
