Voir la notice de l'article provenant de la source Numdam
The notion of treewidth is of considerable interest in relation to NP-hard problems. Indeed, several studies have shown that the tree-decomposition method can be used to solve many basic optimization problems in polynomial time when treewidth is bounded, even if, for arbitrary graphs, computing the treewidth is NP-hard. Several papers present heuristics with computational experiments. For many graphs the discrepancy between the heuristic results and the best lower bounds is still very large. The aim of this paper is to propose two new methods for computing the treewidth of graphs: a heuristic and a metaheuristic. The heuristic returns good results in a short computation time, whereas the metaheuristic (a Tabu search method) returns the best results known to have been obtained so far for all the DIMACS vertex coloring / treewidth benchmarks (a well-known collection of graphs used for both vertex coloring and treewidth problems.) Our results actually improve on the previous best results for treewidth problems in 53% of the cases. Moreover, we identify properties of the triangulation process to optimize the computing time of our method.
Clautiaux, François ; Moukrim, Aziz ; Nègre, Stéphane 1 ; Carlier, Jacques
@article{RO_2004__38_1_13_0,
author = {Clautiaux, Fran\c{c}ois and Moukrim, Aziz and N\`egre, St\'ephane and Carlier, Jacques},
title = {Heuristic and metaheuristic methods for computing graph treewidth},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {13--26},
publisher = {EDP-Sciences},
volume = {38},
number = {1},
year = {2004},
doi = {10.1051/ro:2004011},
mrnumber = {2083969},
zbl = {1092.90065},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.1051/ro:2004011/}
}
TY - JOUR AU - Clautiaux, François AU - Moukrim, Aziz AU - Nègre, Stéphane AU - Carlier, Jacques TI - Heuristic and metaheuristic methods for computing graph treewidth JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2004 SP - 13 EP - 26 VL - 38 IS - 1 PB - EDP-Sciences UR - http://geodesic.mathdoc.fr/articles/10.1051/ro:2004011/ DO - 10.1051/ro:2004011 LA - en ID - RO_2004__38_1_13_0 ER -
%0 Journal Article %A Clautiaux, François %A Moukrim, Aziz %A Nègre, Stéphane %A Carlier, Jacques %T Heuristic and metaheuristic methods for computing graph treewidth %J RAIRO - Operations Research - Recherche Opérationnelle %D 2004 %P 13-26 %V 38 %N 1 %I EDP-Sciences %U http://geodesic.mathdoc.fr/articles/10.1051/ro:2004011/ %R 10.1051/ro:2004011 %G en %F RO_2004__38_1_13_0
Clautiaux, François; Moukrim, Aziz; Nègre, Stéphane; Carlier, Jacques. Heuristic and metaheuristic methods for computing graph treewidth. RAIRO - Operations Research - Recherche Opérationnelle, Tome 38 (2004) no. 1, pp. 13-26. doi: 10.1051/ro:2004011
Cité par Sources :