Approximation algorithms for the minimum power cover problem with submodular/linear penalties.
Xiaofei LiuWeidong LiHan DaiPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- constant factor approximation
- np hard
- special case
- worst case
- facility location problem
- quadratic program
- vertex cover
- primal dual
- approximation ratio
- network design problem
- approximation schemes
- open shop
- disjoint paths
- set cover
- np hardness
- greedy algorithm
- min sum
- randomized algorithms
- network flow
- objective function
- undirected graph
- spanning tree
- energy minimization
- linear programming
- computational complexity
- search algorithm