Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint.
Canh V. PhamTan D. TranDung K. T. HaMy T. ThaiPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- constant factor approximation
- np hard
- worst case
- vertex cover
- upper bound
- special case
- facility location problem
- submodular functions
- network design problem
- knapsack problem
- minimum cost
- objective function
- set cover
- approximation ratio
- open shop
- optimal solution
- linear constraints
- precedence constraints
- greedy algorithm
- quadratic program
- dynamic programming
- disjoint paths
- approximation schemes
- constant factor
- np hardness
- primal dual
- combinatorial auctions
- polynomial time approximation
- closest string
- learning algorithm
- mathematical model
- undirected graph