Approximation algorithms for dynamic resource allocation.
Vivek F. FariasBenjamin Van RoyPublished in: Oper. Res. Lett. (2006)
Keyphrases
- approximation algorithms
- dynamic resource allocation
- np hard
- special case
- worst case
- resource allocation
- vertex cover
- minimum cost
- approximation ratio
- facility location problem
- set cover
- allocation policies
- randomized algorithms
- constant factor
- approximation schemes
- network design problem
- exact algorithms
- open shop
- combinatorial auctions
- disjoint paths
- precedence constraints
- primal dual
- greedy algorithm
- linear programming
- lower bound