Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint.
Canh V. PhamTan D. TranDung T. K. HaMy T. ThaiPublished in: IJCAI (2023)
Keyphrases
- approximation algorithms
- constant factor approximation
- np hard
- worst case
- special case
- upper bound
- facility location problem
- vertex cover
- objective function
- submodular functions
- knapsack problem
- greedy algorithm
- set cover
- network design problem
- minimum cost
- constant factor
- dynamic programming
- linear constraints
- open shop
- randomized algorithms
- approximation schemes
- disjoint paths
- greedy heuristic
- np hardness
- undirected graph
- approximation ratio
- boolean functions
- feasible solution
- anti monotone
- optimal solution