Polynomial-time approximation algorithms for weighted LCS problem.
Marek CyganMarcin KubicaJakub RadoszewskiWojciech RytterTomasz WalenPublished in: Discret. Appl. Math. (2016)
Keyphrases
- approximation algorithms
- longest common subsequence
- special case
- np hard
- approximation ratio
- worst case
- network design problem
- facility location problem
- set cover
- vertex cover
- learning classifier systems
- primal dual
- minimum cost
- np hardness
- constant factor
- open shop
- randomized algorithms
- constant factor approximation
- disjoint paths
- approximation schemes
- polynomial time approximation
- undirected graph
- objective function
- learning algorithm