Approximation Algorithms for the Lower-Bounded Knapsack Median Problem.
Lu HanChunlin HaoChenchen WuZhenning ZhangPublished in: AAIM (2020)
Keyphrases
- approximation algorithms
- constant factor approximation
- np hard
- special case
- knapsack problem
- vertex cover
- worst case
- facility location problem
- minimum cost
- network design problem
- optimal solution
- primal dual
- exact algorithms
- upper bound
- approximation ratio
- constant factor
- dynamic programming
- open shop
- approximation schemes
- np hardness
- combinatorial auctions
- packing problem
- feasible solution
- precedence constraints
- branch and bound
- greedy heuristic
- search algorithm