Polynomial-Time Approximation Algorithms for Weighted LCS Problem.
Marek CyganMarcin KubicaJakub RadoszewskiWojciech RytterTomasz WalenPublished in: CPM (2011)
Keyphrases
- approximation algorithms
- longest common subsequence
- special case
- np hard
- worst case
- np hardness
- vertex cover
- minimum cost
- approximation ratio
- set cover
- learning classifier systems
- facility location problem
- network design problem
- primal dual
- constant factor
- approximation schemes
- polynomial time approximation
- open shop
- precedence constraints
- undirected graph
- randomized algorithms
- integer programming
- constant factor approximation
- genetic algorithm
- upper bound