Exponential approximation schemata for some network design problems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Discrete Algorithms Année : 2013

Exponential approximation schemata for some network design problems

Résumé

We study approximation of some well-known network design problems such as traveling salesman problem (for both minimization and maximization versions) and min steiner tree, by moderately exponential algorithms. The general goal of the issue of moderately exponential approximationis to catch-up on polynomial inapproximability, by providing algorithms achieving, with worst-caserunning times importantly smaller than those needed for exact computation, approximation ratiosunachievable in polynomial time.
Fichier principal
Vignette du fichier
cahier303.PDF (258.31 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01509539 , version 1 (18-04-2017)

Identifiants

Citer

Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. Exponential approximation schemata for some network design problems. Journal of Discrete Algorithms, 2013, 22, ⟨10.1016/j.jda.2013.06.011⟩. ⟨hal-01509539⟩
70 Consultations
81 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More