Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms.
Will MaPublished in: Math. Oper. Res. (2018)
Keyphrases
- approximation algorithms
- approximation schemes
- stochastic systems
- np hard
- point processes
- special case
- worst case
- knapsack problem
- vertex cover
- approximation ratio
- minimum cost
- randomized algorithms
- dynamic programming
- open shop
- primal dual
- stochastic models
- facility location problem
- greedy heuristic
- network design problem
- constant factor
- set cover
- np hardness
- undirected graph
- upper bound
- constant factor approximation
- approximation guarantees
- precedence constraints
- multi armed bandit