How to probe for an extreme value

DOI10.1145/1868237.1868250MaRDI QIDQ3188994zbMATH OpenOpenAlexFDO

Authors Ashish Goel, Sudipto Guha, Kamesh Munagala

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

approximation algorithmsminimum valueobservationsstochastic optimization

Mathematics Subject Classification ID

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

Recommendations

• Estimation of the extreme value and the extreme points
• scientific article; zbMATH DE number 1082202
• On testing extreme value conditions
• scientific article; zbMATH DE number 4069556
• scientific article; zbMATH DE number 4088723

Cited in

(6)

• Model-driven optimization using adaptive probes
• Adaptive uncertainty resolution in Bayesian combinatorial optimization problems
• The benefit of adaptivity in stochastic packing problems with probing
• Stochastic Probing with Increasing Precision
• Pandora Box problem with nonobligatory inspection: hardness and approximation scheme
• Identifying approximate minimizers under stochastic uncertainity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188994)