Moderately exponential approximation

MaRDI QIDQ3109950zbMATH OpenFDO

Authors Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Emeric Tourniaire

Publication date 26 January 2012

zbMATH Keywords

approximation ratiodevising algorithmsNP-hard problemspolynomial approximation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Moderately exponential approximation: bridging the gap between exact computation and polynomial approximation
• Preface
• Moderately exponential time and fixed parameter approximation algorithms
• Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
• When polynomial approximation meets exact computation

Cited in

(5)

• Moderately exponential time and fixed parameter approximation algorithms
• Exponential approximation schemata for some network design problems
• Moderately exponential approximation: bridging the gap between exact computation and polynomial approximation
• When polynomial approximation meets exact computation
• Preface

This page was built for publication: Moderately exponential approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109950)