Near linear time 5/3-approximation algorithms for two-level power assignment problems.
Benjamin GrimmerKan QiaoPublished in: FOMC (2014)
Keyphrases
- approximation algorithms
- worst case
- np hard
- special case
- vertex cover
- facility location problem
- network design problem
- minimum cost
- np hardness
- exact algorithms
- set cover
- randomized algorithms
- primal dual
- precedence constraints
- approximation ratio
- constant factor
- approximation schemes
- disjoint paths
- open shop
- upper bound
- constant factor approximation
- greedy algorithm
- polynomial time approximation
- error bounds
- genetic algorithm