Exponential approximation schemata for some network design problems - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2011

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 approximation is to catch-up on polynomial inapproximability, by providing algorithms achieving, with worst-case running times importantly smaller than those needed for exact computation, approximation ratios unachievable in polynomial time.
Fichier principal
Vignette du fichier
cahier_303.pdf (258.31 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00875650 , version 1 (22-10-2013)

Identifiants

  • HAL Id : hal-00875650 , version 1

Citer

Nicolas Boria, Nicolas Bourgeois, Bruno Escoffier, Vangelis Paschos. Exponential approximation schemata for some network design problems. 2011. ⟨hal-00875650⟩
124 Consultations
156 Téléchargements

Partager

Gmail Facebook X LinkedIn More