New Approximation Algorithms for Longest Common Subsequences.
Lasse BergrothHarri HakonenTimo RaitaPublished in: SPIRE (1998)
Keyphrases
- approximation algorithms
- longest common subsequence
- np hard
- special case
- minimum cost
- worst case
- facility location problem
- vertex cover
- dynamic time warping
- approximation schemes
- primal dual
- open shop
- exact algorithms
- np hardness
- set cover
- approximation ratio
- suffix array
- randomized algorithms
- constant factor
- constant factor approximation
- network design problem
- precedence constraints
- undirected graph
- combinatorial auctions