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