Thumbnail - Request a copy

When polynomial approximation meets exact computation

Paschos, Vangelis (2015), When polynomial approximation meets exact computation, 4OR, 13, 3, p. 227-245. 10.1007/s10288-015-0294-7

Type
Article accepté pour publication ou publié
Date
2015
Journal name
4OR
Volume
13
Number
3
Publisher
Springer
Pages
227-245
Publication identifier
Metadata
Show full item record
Author(s)
Paschos, Vangelis
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
We outline a relatively new research agenda aiming at building a new approximation paradigm by matching two distinct domains, the polynomial approximation and the exact solution of NP -hard problems by algorithms with guaranteed and non-trivial upper complexity bounds. We show how one can design approximation algorithms achieving ratios that are “forbidden” in polynomial time (unless a very unlikely complexity conjecture is confirmed) with worst-case complexity much lower than that of an exact computation.
Subjects / Keywords
Complexity; Polynomial approximation; Exact algorithm; Moderately exponential approximation