Approximation Algorithms for LCS and LIS with Truly Improved Running Times.
Aviad RubinsteinSaeed SeddighinZhao SongXiaorui SunPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- running times
- worst case
- np hard
- longest common subsequence
- lower bound
- times faster
- vertex cover
- minimum cost
- special case
- facility location problem
- set cover
- error bounds
- upper bound
- approximation schemes
- np hardness
- network design problem
- approximation ratio
- open shop
- undirected graph
- greedy algorithm
- learning classifier systems
- exact algorithms
- disjoint paths
- learning algorithm
- precedence constraints
- primal dual
- computational complexity
- search algorithm