Lower Bounds for Approximation Schemes for Closest String.
Marek CyganDaniel LokshtanovMarcin PilipczukMichal PilipczukSaket SaurabhPublished in: SWAT (2016)
Keyphrases
- approximation schemes
- closest string
- lower bound
- approximation algorithms
- np hard
- worst case
- upper bound
- randomized algorithm
- constant factor approximation
- branch and bound algorithm
- branch and bound
- objective function
- optimal solution
- special case
- np complete
- feasible solution
- integer programming
- error bounds
- numerical methods
- scheduling problem
- linear program
- vc dimension
- bin packing
- multi class
- practical solutions
- support vector machine