Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems.
Oscar H. IbarraChul E. KimPublished in: J. ACM (1975)
Keyphrases
- lower bound
- approximation algorithms
- np hard
- randomized algorithms
- upper bound
- worst case
- constant factor
- vertex cover
- objective function
- np hardness
- np complete
- optimal solution
- minimum cost
- exact algorithms
- network design problem
- approximation schemes
- facility location problem
- practical problems
- special case
- knapsack problem
- feasible solution
- dynamic programming
- undirected graph
- set cover
- open shop
- weighted sum
- optimization problems
- closest string