How to probe for an extreme value

DOI10.1145/1868237.1868250zbMath1295.90027OpenAlexW2058632122MaRDI QIDQ3188994

Sudipto Guha, Kamesh Munagala, Ashish Goel

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1868237.1868250

zbMATH Keywords

stochastic optimizationapproximation algorithmsobservationsminimum value

Mathematics Subject Classification ID

Integer programming (90C10) Stochastic programming (90C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Stochastic Probing with Increasing Precision ⋮ The benefit of adaptivity in stochastic packing problems with probing

This page was built for publication: How to probe for an extreme value