New Approximation Algorithms for Some Dynamic Storage Allocation Problems.
Shuai Cheng LiHon Wai LeongSteven K. QuekPublished in: COCOON (2004)
Keyphrases
- approximation algorithms
- allocation problems
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- open shop
- resource allocation
- approximation ratio
- facility location problem
- np hardness
- precedence constraints
- primal dual
- set cover
- randomized algorithms
- polynomial time approximation
- approximation schemes
- network design problem
- constant factor
- approximation guarantees
- combinatorial auctions
- greedy algorithm