Algorithmes exponentiels pour l'étiquetage, la domination et l'ordonnancement

Abstract : This manuscript of Habilitation à Diriger des Recherches enlights some results obtained since my PhD, I defended in 2007. The presented results have been mainly published in international conferences and journals. Exponential-time algorithms are given to solve various decision, optimization and enumeration problems. First, we are interested in solving the L(2,1)-labeling problem for which several algorithms are described (based on branching, divide-and-conquer and dynamic programming). Some combinatorial bounds are also established to analyze those algorithms. Then we solve domination-like problems. We develop algorithms to solve a generalization of the dominating set problem and we give algorithms to enumerate minimal dominating sets in some graph classes. As a consequence, the analysis of these algorithms implies combinatorial bounds. Finally, we extend our field of applications of moderately exponential-time algorithms to scheduling problems. By using dynamic programming paradigm and by extending the sort-and-search approach, we are able to solve a family of scheduling problems.
Document type :
Habilitation à diriger des recherches
Complete list of metadatas

Cited literature [124 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01249255
Contributor : Mathieu Liedloff <>
Submitted on : Wednesday, December 30, 2015 - 8:39:04 PM
Last modification on : Thursday, January 17, 2019 - 3:06:06 PM
Long-term archiving on : Friday, April 1, 2016 - 12:55:52 AM

Identifiers

  • HAL Id : tel-01249255, version 1

Collections

Citation

Mathieu Liedloff. Algorithmes exponentiels pour l'étiquetage, la domination et l'ordonnancement. Algorithme et structure de données [cs.DS]. Université d'Orléans, 2015. ⟨tel-01249255⟩

Share

Metrics

Record views

397

Files downloads

829