Super-polynomial approximation branching algorithms - Archive ouverte HAL Access content directly
Journal Articles RAIRO - Operations Research Year : 2016

Super-polynomial approximation branching algorithms

Abstract

We give sufficient conditions for deriving moderately exponential and/or parameterized time approximation schemata (i.e., algorithms achieving ratios 1 ± , for arbitrarily small) for broad classes of combinatorial optimization problems via a well-known technique widely used for deriving exact algorithms, namely the branching tree pruning. Mathematics Subject Classification. 68W25, 05C85, 68Q25.
Fichier principal
Vignette du fichier
Escoffier_2016_Super-Polynomial.pdf (457.05 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01432021 , version 1 (11-01-2017)

Identifiers

Cite

Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire. Super-polynomial approximation branching algorithms. RAIRO - Operations Research, 2016, 50 (4-5), pp.979 - 994. ⟨10.1051/ro/2015060⟩. ⟨hal-01432021⟩
92 View
182 Download

Altmetric

Share

Gmail Facebook X LinkedIn More