Stability of Approximation Algorithms and the Knapsack Problem.
Juraj HromkovicPublished in: Jewels are Forever (1999)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- optimal solution
- exact algorithms
- combinatorial optimization problems
- special case
- worst case
- vertex cover
- minimum cost
- integer programming
- dynamic programming
- scheduling problem
- multidimensional knapsack problem
- optimization problems
- lower bound
- primal dual
- linear programming relaxation
- branch and bound algorithm
- randomized algorithms
- greedy algorithm
- production planning
- constraint satisfaction problems
- cutting plane
- open shop
- set cover
- computational complexity
- combinatorial auctions
- linear programming
- binary variables
- network design problem
- approximation ratio
- multistage
- disjoint paths
- maximum profit
- greedy heuristic
- constant factor
- lagrangian relaxation
- polynomial time approximation
- implicit enumeration