Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits
Anupam GuptaRavishankar KrishnaswamyMarco MolinaroR. RaviPublished in: CoRR (2011)
Keyphrases
- approximation algorithms
- np hard
- special case
- knapsack problem
- worst case
- vertex cover
- facility location problem
- set cover
- minimum cost
- primal dual
- network design problem
- approximation ratio
- approximation schemes
- constant factor
- np hardness
- precedence constraints
- randomized algorithms
- open shop
- optimal solution
- combinatorial auctions
- simulated annealing