Improved approximation algorithms for k-submodular maximization under a knapsack constraint.
Dung T. K. HaCanh V. PhamTan D. TranPublished in: Comput. Oper. Res. (2024)
Keyphrases
- approximation algorithms
- np hard
- constant factor approximation
- special case
- worst case
- vertex cover
- minimum cost
- objective function
- greedy algorithm
- facility location problem
- network design problem
- set cover
- knapsack problem
- approximation schemes
- primal dual
- np hardness
- exact algorithms
- approximation ratio
- precedence constraints
- constant factor
- open shop
- disjoint paths
- undirected graph
- linear programming
- upper bound
- optimal solution