Skip to Main content Skip to Navigation
Theses

Problèmes NP-difficiles : approximation modérément exponentielle et complexité paramétrique

Abstract : We give in this thesis some moderately exponential algorithms for the MAX SAT problem. We discuss a very general method to conceive efficient exponential algorithms that give approximation scheme. In the end, we present some parameterized results for CUT problem with constrained cardinality.
Document type :
Theses
Complete list of metadata

Cited literature [94 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00874599
Contributor : Abes Star :  Contact
Submitted on : Friday, October 18, 2013 - 11:42:24 AM
Last modification on : Friday, November 6, 2020 - 3:37:38 AM
Long-term archiving on: : Sunday, January 19, 2014 - 4:25:48 AM

File

Emeric.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00874599, version 1

Citation

Emeric Tourniaire. Problèmes NP-difficiles : approximation modérément exponentielle et complexité paramétrique. Autre [cs.OH]. Université Paris Dauphine - Paris IX, 2013. Français. ⟨NNT : 2013PA090008⟩. ⟨tel-00874599⟩

Share

Metrics

Record views

585

Files downloads

2918