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