On molecular approximation algorithms for NP optimization problem.
Bin FuRichard BeigelPublished in: DNA Based Computers (1997)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- facility location problem
- quadratic program
- approximation schemes
- primal dual
- network design problem
- approximation ratio
- set cover
- randomized algorithms
- np complete
- optimization problems
- computational complexity
- optimal solution
- disjoint paths
- undirected graph
- lower bound
- np hardness
- precedence constraints
- exact algorithms
- constant factor
- open shop
- optimization model
- polynomial time approximation
- theoretical analysis
- scheduling problem