On Two Techniques of Combining Branching and Treewidth

Fedor V. Fomin 1 Serge Gaspers 2 Saket Saurabh 1 Alexey A. Stepanov 1
2 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Branch & Reduce and dynamic programming on graphs of bounded treewidth are among the most common and powerful techniques used in the design of moderately exponential time exact algorithms for NP hard problems. In this paper we discuss the efficiency of simple algorithms based on combinations of these techniques. The idea behind these algorithms is very natural: If a parameter like the treewidth of a graph is small, algorithms based on dynamic programming perform well. On the other side, if the treewidth is large, then there must be vertices of high degree in the graph, which is good for branching algorithms. We give several examples of possible combinations of branching and programming which provide the fastest known algorithms for a number of NP hard problems. All our algorithms require non-trivial balancing of these two techniques. In the first approach the algorithm either performs fast branching, or if there is an obstacle for fast branching, this obstacle is used for the construction of a path decomposition of small width for the original graph. Using this approach we give the fastest known algorithms for Minimum Maximal Matching and for counting all 3-colorings of a graph. In the second approach the branching occurs until the algorithm reaches a subproblem with a small number of edges (and here the right choice of the size of subproblems is crucial) and then dynamic programming is applied on these subproblems of small width. We exemplify this approach by giving the fastest known algorithm to count all minimum weighted dominating sets of a graph. We also discuss how similar techniques can be used to design faster parameterized algorithms.
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00399668
Contributeur : Serge Gaspers <>
Soumis le : dimanche 28 juin 2009 - 01:27:56
Dernière modification le : jeudi 24 mai 2018 - 15:59:22

Lien texte intégral

Identifiants

Collections

Citation

Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov. On Two Techniques of Combining Branching and Treewidth. Algorithmica, Springer Verlag, 2009, 54 (2), pp.181-207. 〈http://dx.doi.org/10.1007/s00453-007-9133-3〉. 〈10.1007/s00453-007-9133-3〉. 〈lirmm-00399668〉

Partager

Métriques

Consultations de la notice

151