Constant-Time Approximation Algorithms for the Knapsack Problem.
Hiro ItoSusumu KiyoshimaYuichi YoshidaPublished in: TAMC (2012)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- optimal solution
- exact algorithms
- combinatorial optimization problems
- worst case
- special case
- vertex cover
- minimum cost
- approximation ratio
- branch and bound algorithm
- optimization problems
- scheduling problem
- primal dual
- set cover
- greedy heuristic
- computational complexity
- multidimensional knapsack problem
- linear programming relaxation
- open shop
- production planning
- greedy algorithm
- linear program
- randomized algorithms
- integer programming
- linear programming
- greedy algorithms
- constraint satisfaction problems
- constant factor
- lower bound
- dynamic programming
- network design problem
- constant factor approximation
- precedence constraints
- cutting plane
- undirected graph
- binary variables
- polynomial time approximation