Approximation Algorithms for Local Alignment with Length Constraints.
Abdullah N. ArslanÖmer EgeciogluPublished in: Int. J. Found. Comput. Sci. (2002)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- precedence constraints
- vertex cover
- facility location problem
- minimum cost
- approximation ratio
- constant factor
- np hardness
- longest common subsequence
- set cover
- constraint programming
- linear constraints
- primal dual
- randomized algorithms
- disjoint paths
- combinatorial auctions
- greedy algorithm
- approximation schemes
- open shop
- constant factor approximation