Approximation Algorithms for the Shortest Common Supersequence.
C. B. FraserRobert W. IrvingPublished in: Nord. J. Comput. (1995)
Keyphrases
- approximation algorithms
- shortest common supersequence
- np hard
- special case
- minimum cost
- worst case
- scheduling problem
- vertex cover
- integer programming
- lower bound
- optimal solution
- open shop
- np hardness
- facility location problem
- approximation ratio
- linear programming
- exact algorithms
- set cover
- constant factor
- undirected graph
- network design problem
- primal dual
- branch and bound algorithm
- precedence constraints
- knapsack problem
- randomized algorithms
- approximation schemes
- linear program
- computational complexity
- constraint satisfaction problems