Approximation algorithms for the submodular edge cover problem with submodular penalties.
Xin WangSuogang GaoBo HouLidong WuWen LiuPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- approximation algorithms
- disjoint paths
- greedy algorithm
- np hard
- undirected graph
- worst case
- special case
- vertex cover
- facility location problem
- set cover
- objective function
- approximation ratio
- minimum cost
- open shop
- primal dual
- network design problem
- randomized algorithms
- precedence constraints
- energy minimization
- combinatorial auctions
- constant factor
- edge detection
- dynamic programming
- exact algorithms
- approximation guarantees
- np hardness
- integer programming
- lower bound
- optimal solution