Approximation Algorithms for the Minimum Power Partial Cover Problem.
Menghong LiYingli RanZhao ZhangPublished in: AAIM (2019)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- np hard
- special case
- vertex cover
- worst case
- network design problem
- precedence constraints
- facility location problem
- primal dual
- approximation schemes
- set cover
- approximation ratio
- lower bound
- network flow
- undirected graph
- randomized algorithms
- np hardness
- open shop
- disjoint paths
- theoretical analysis
- upper bound
- optimal solution