Approximation algorithms for constrained generalized tree alignment problem.
Srikrishnan DivakaranPublished in: Discret. Appl. Math. (2009)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- set cover
- facility location problem
- minimum cost
- tree structure
- np hardness
- approximation ratio
- primal dual
- spanning tree
- network design problem
- constant factor
- optimal solution
- constant factor approximation
- polynomial time approximation
- open shop
- precedence constraints
- undirected graph
- dynamic time warping
- linear programming
- approximation guarantees
- randomized algorithms
- upper bound
- approximation schemes
- scheduling problem
- lower bound
- computational complexity