Approximation Algorithms for a Class of Stochastic Selection Problems with Reward and Cost Considerations.
Zohar M. A. StrinkaH. Edwin RomeijnPublished in: Oper. Res. (2018)
Keyphrases
- approximation algorithms
- approximation schemes
- vertex cover
- minimum cost
- np hard
- special case
- randomized algorithms
- exact algorithms
- network design problem
- disjoint paths
- constant factor
- np hardness
- optimization problems
- optimal solution
- primal dual
- facility location problem
- reinforcement learning
- set cover
- constraint satisfaction problems
- strongly np hard
- objective function