Approximation Algorithms for String Folding Problems.
Giancarlo MauriGiulio PavesiPublished in: IFIP TCS (2000)
Keyphrases
- approximation algorithms
- vertex cover
- special case
- randomized algorithms
- np hard
- exact algorithms
- np hardness
- worst case
- minimum cost
- approximation schemes
- np complete
- network design problem
- evolutionary algorithm
- facility location problem
- approximation ratio
- set cover
- primal dual
- optimization problems
- practical problems
- scheduling problem
- linear program