Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions.
André LinharesChaitanya SwamyPublished in: STOC (2019)
Keyphrases
- black box
- approximation algorithms
- stochastic optimization
- robust optimization
- np hard
- black boxes
- special case
- vertex cover
- multistage
- mathematical programming
- worst case
- minimum cost
- approximation ratio
- white box
- set cover
- random variables
- test cases
- disjoint paths
- decision theory
- primal dual
- linear program
- randomized algorithms
- polynomial time approximation
- genetic algorithm
- integration testing
- scheduling problem
- probability distribution
- constant factor approximation
- white box testing