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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01432021
Contributor : Gestionnaire Hal-Upmc <>
Submitted on : Wednesday, January 11, 2017 - 2:23:42 PM
Last modification on : Thursday, March 21, 2019 - 1:11:06 PM
Long-term archiving on : Friday, April 14, 2017 - 4:42:31 PM

File

Escoffier_2016_Super-Polynomia...
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

172

Files downloads

144