Volume 50, Number 4-5, October-December 2016
|Page(s)||979 - 994|
|Published online||03 November 2016|
Super-polynomial approximation branching algorithms∗
1 Sorbonne Universités, UPMC Univ Paris 06, CNRS, LIP6 UMR
7606, 4 place Jussieu, 75005 Paris, France.
2 PSL Research University, Université Paris-Dauphine, LAMSADE CNRS UMR 7243, Paris, France.
Accepted: 23 November 2015
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
Key words: Branching algorithm / moderately exponential approximation / approximation schema
© EDP Sciences, ROADEF, SMAI 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.