Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
References
Ausiello G, Crescenzi P, Protasi M (1995) Approximate solution of NP optimization problems. Theor Comput Sci 150(1):1–55
Bazgan C, Escoffier B, Paschos VTh (2005) Poly-APX- and PTAS-completeness in standard and differential approximation. Theor Comput Sci 339(2–3):272–292
Della Croce F, Escoffier B, Murat C, Paschos VTh (2005) Probabilistic coloring of bipartite and split graphs. In: proceedings of ICCSA’05, vol 3483 of LNCS, pp 202–211
Demange M, Monnot J, Paschos VTh (2001) Maximizing the number of unused bins. Found Comput Decis Sci 26(2):169–186
Demange M, de Werra D, Escoffier B, Monnot J, Paschos VTh (2004) Weighted coloring on planar, bipartite and split graphs: complexity and improved approximation In: proceedings of ISAAC’04, vol 3341 of LNCS, pp 896–907
Escoffier B, Hammer PL (2005) Approximation of the quadratic set covering problem. DIMACS Technical Report 2005–09
Escoffier B, Paschos VTh (2005) Proving completeness by logic. Int J Comput Math 82(2):151–161
Escoffier B, Paschos VTh (2006) Differential approximation of MIN SAT, MAX SAT and related problems. Eur J Oper Res (to appear)
Escoffier B, Monnot J, Paschos VTh (2006) Weighted coloring: further complexity and approximations results. Inf Process Lett 97(3):98–103
Fagin R (1974) General first-order spectra and polynomial time recognizable sets. In: Karp RM (ed) Complexity of computations, vol 7. AMS, New York, pp 43–73
Guan DJ, Zhu X (1997) A coloring problem for weighted graphs. Inf Process Lett 61(2):77–81
Kolaitis PG, Thakur MN (1994) Logical definability of NP optimization problems. Inf Comput 115(2):321–353
Murat C, Paschos VTh (2006) Probabilistic combinatorial optimization on graphs. Hermes Science Publishing, London
Papadimitriou CH, Yannakakis M (1991) Optimization, approximation, and complexity classes. J Comput Syst Sci 43(3):425–440
Author information
Authors and Affiliations
Corresponding author
Additional information
http://www.lamsade.dauphine.fr/~escoffier/fichiers/TheseEscoffier.pdf
Rights and permissions
About this article
Cite this article
Escoffier, B. Polynomial approximation: a structural and operational study. 4OR 5, 161–164 (2007). https://doi.org/10.1007/s10288-006-0027-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-006-0027-z