Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation

Résumé

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 confirmed) with worst-case complexity much lower (though super-polynomial) than that of an exact computation.
presentation_1.pdf (690.05 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01511873 , version 1 (21-04-2017)

Identifiants

  • HAL Id : hal-01511873 , version 1

Citer

Vangelis Paschos. Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation. 1st International Symposium and 10th Balkan Conference on Operational Research (BALCOR 2011), Sep 2011, Thessalonique, Greece. pp.1-14. ⟨hal-01511873⟩
93 Consultations
50 Téléchargements

Partager

Gmail Facebook X LinkedIn More