Approximation Algorithms for Generalized Multidimensional Knapsack.
Arindam KhanEklavya SharmaK. V. N. SreenivasPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- knapsack problem
- vertex cover
- worst case
- minimum cost
- dynamic programming
- exact algorithms
- upper bound
- facility location problem
- approximation ratio
- network design problem
- precedence constraints
- open shop
- primal dual
- set cover
- packing problem
- approximation schemes
- np hardness
- randomized algorithms
- constant factor approximation
- constant factor
- search algorithm
- optimal solution
- greedy heuristic
- evolutionary algorithm
- disjoint paths
- genetic algorithm