Algorithmes exacts et exponentiels pour les problèmes NP-difficiles : domination, variantes et généralisations

Abstract : The first exact exponential-time algorithms solving NP-hard problems date back to the sixties. The last years have seen an increasing interest for designing such algorithms as well as analysing their running time. The existence of many applications of well known hard problems is one of the main motivations. Moreover, under the hypothesis P 6= NP, apolynomial time algorithm for these problems does not exist. In this thesis, we deal with the classical domination problem in graphs. We are also interested in some variants and generalizations of this fondamental problem. We give exponential-time algorithms for computing a minimum dominating set on c-dense graphs, chordal graphs, 4-chordal graphs, weakly chordal graphs, circle graphs and bipartite graphs. Then, we study the dominating clique problem requiring to find a minimum dominating set inducing a clique of the graph. We provide a Branch & Reduce algorithm computing a minimum dominating clique. The analysis of the running time is done by using the Measure and Conquer technique. Afterwards, we propose a general algorithm for enumerating all (%)-dominating sets of a graph in time O(cn), with c < 2, under some assumptions on the sets and %. Subsequently, we establish a combinatorial upper bound on the number of such sets in a graph. Finally, we consider a partial dominating set problem and we give an algorithm for solving the Roman domination problem. Using the dynamic programming paradigm, we obtain an algorithm for the domination problem with flexible powers
Complete list of metadatas

Cited literature [152 references]  Display  Hide  Download

https://hal.univ-lorraine.fr/tel-01749022
Contributor : Thèses Ul <>
Submitted on : Thursday, March 29, 2018 - 11:59:00 AM
Last modification on : Wednesday, April 11, 2018 - 1:27:57 AM
Long-term archiving on: Friday, September 14, 2018 - 9:24:12 AM

File

Liedloff.Mathieu.SMZ0727.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : tel-01749022, version 1

Collections

Citation

Mathieu Liedloff. Algorithmes exacts et exponentiels pour les problèmes NP-difficiles : domination, variantes et généralisations. Autre [cs.OH]. Université Paul Verlaine - Metz, 2007. Français. ⟨NNT : 2007METZ027S⟩. ⟨tel-01749022⟩

Share

Metrics

Record views

52

Files downloads

254