Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds.
Amir AbboudAviad RubinsteinPublished in: ITCS (2018)
Keyphrases
- constant factor
- approximation algorithms
- lower bound
- randomized algorithms
- np hard
- longest common subsequence
- upper bound
- worst case
- approximation guarantees
- special case
- branch and bound
- vertex cover
- minimum cost
- branch and bound algorithm
- optimal solution
- lower and upper bounds
- primal dual
- objective function
- approximation ratio
- knapsack problem
- lagrangian relaxation
- cutting plane
- error bounds
- randomized algorithm
- semi supervised
- scheduling problem
- strongly np hard
- search algorithm
- integrality gap