Polynomial approximation: a structural and operational study
Escoffier, Bruno (2007), Polynomial approximation: a structural and operational study, 4OR, 5, 2, p. 161-164. http://dx.doi.org/10.1007/s10288-006-0027-z
TypeArticle accepté pour publication ou publié
External document linkhttp://basepub.dauphine.fr/xmlui/handle/123456789/13371
MetadataShow full item record
Abstract (EN)This is a summary of the most important results of the author’s PhD thesis. This thesis, supervised by Vangelis Th. Paschos, was defended in October 2005 at the Université Paris Dauphine. It is written in French and is available on-line. The thesis is focused on combinatorial optimization problems, studied from the standpoint of polynomial approximation theory. We were interested both in structural concerns (mainly completeness in approximation classes and logical expressivity) and operational ones (with the study of satisfiability, coloring and covering problems).
Subjects / KeywordsCombinatorial optimization; Approximation; Completeness; Differential ratio
Showing items related by title and author.
Gourvès, Laurent; Escoffier, Bruno; Spanjaard, Olivier; Monnot, Jérôme (2010) Article accepté pour publication ou publié
New Results on Polynomial Inapproximability and Fixed Parameter Approximability of Edge Dominating Set Escoffier, Bruno; Monnot, Jérôme; Paschos, Vangelis; Xiao, Mingyu (2015) Article accepté pour publication ou publié
Paschos, Vangelis; Monnot, Jérôme; Escoffier, Bruno; Demange, Marc; de Werra, Dominique (2009) Article accepté pour publication ou publié