Two linear approximation algorithms for the subset-sum problem.
Hans KellererRenata MansiniMaria Grazia SperanzaPublished in: Eur. J. Oper. Res. (2000)
Keyphrases
- approximation algorithms
- constant factor approximation
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- exact algorithms
- primal dual
- np hardness
- set cover
- open shop
- randomized algorithms
- network design problem
- quadratic program
- facility location problem
- constant factor
- approximation ratio
- precedence constraints
- undirected graph
- linear programming
- lower bound