Improved Approximation Algorithms for Tree Alignment.
Lusheng WangDan GusfieldPublished in: J. Algorithms (1997)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- vertex cover
- worst case
- facility location problem
- network design problem
- spanning tree
- primal dual
- set cover
- approximation ratio
- randomized algorithms
- tree structure
- open shop
- approximation schemes
- dynamic time warping
- learning algorithm
- np hardness
- knapsack problem
- constant factor
- disjoint paths
- constant factor approximation