Robust Approximation Algorithms for Non-monotone k-Submodular Maximization under a Knapsack Constraint.
Dung T. K. HaCanh V. PhamTan D. TranHuan X. HoangPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- constant factor approximation
- upper bound
- vertex cover
- facility location problem
- minimum cost
- greedy algorithm
- objective function
- set cover
- submodular functions
- knapsack problem
- dynamic programming
- network design problem
- randomized algorithms
- lower bound
- approximation ratio
- open shop
- primal dual
- approximation schemes
- constant factor
- greedy heuristic
- precedence constraints
- undirected graph
- energy minimization
- optimal solution