Effcient approximation by ” low-complexity ” exponential algorithms

@inproceedings{Bourgeois2016EffcientAB,
  title={Effcient approximation by ” low-complexity ” exponential algorithms},
  author={Nicolas Bourgeois and Bruno Escoffier and Vangelis Th. Paschos},
  year={2016}
}
This paper proposes a way to bring together two seemingly “foreign” domains that are the polynomial approximation and the exact computation for NP-hard problems. We show how one can match ideas from both areas in order to design approximation algorithms achieving ratios unachievable in polynomial time (unless a very unlikely complexity conjecture is… CONTINUE READING