Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties.
Xiaofei LiuWeidong LiPublished in: J. Comb. Optim. (2022)
Keyphrases
- approximation algorithms
- greedy algorithm
- worst case
- np hard
- set cover
- special case
- minimum cost
- vertex cover
- objective function
- rooted trees
- np hardness
- approximation ratio
- facility location problem
- randomized algorithms
- energy minimization
- open shop
- disjoint paths
- undirected graph
- primal dual
- network design problem
- combinatorial auctions
- constant factor
- polynomial time approximation
- approximation schemes
- tree structure
- knapsack problem