Lower Bounding Techniques for DSATUR-based Branch and Bound

Abstract : Given an undirected graph, the Vertex Coloring Problem (VCP) consists of assigning a color to each vertex of the graph such that two adjacent vertices do not share the same color and the total number of colors is minimized. DSATUR-based Branch-and-Bound is a well-known exact algorithm for the VCP. One of its main drawbacks is that a lower bound (equal to the size of a maximal clique) is computed once at the root of the branching scheme and it is never updated during the execution of the algorithm. In this article, we show how to update the lower bound and we compare the efficiency of several lower bounding techniques.
Type de document :
Article dans une revue
Electronic Notes in Discrete Mathematics, 2016, 52, 〈10.1016/j.endm.2016.03.020〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01337588
Contributeur : Christine Okret-Manville <>
Soumis le : lundi 27 juin 2016 - 11:48:11
Dernière modification le : jeudi 11 janvier 2018 - 06:17:30

Identifiants

Collections

Citation

Fabio Furini, Virginie Gabrel, Ian-Christopher Ternier. Lower Bounding Techniques for DSATUR-based Branch and Bound. Electronic Notes in Discrete Mathematics, 2016, 52, 〈10.1016/j.endm.2016.03.020〉. 〈hal-01337588〉

Partager

Métriques

Consultations de la notice

72