Abstract : In this paper we introduce a new algorithm to find a approximate solution for cyclic bandwidth sum problem (CBSP). This problem consists in a minimization of the sum of the distances in the numbering between pairs of vertices connected by a edge. A method based on a depth-first search is proposed where the order in which the nodes are traversed depends on a criterion based on the the Jaccard index between the current node and its neighbors. This method is faster and more effective than the other available heuristics.
https://hal-ens-lyon.archives-ouvertes.fr/ensl-00878041
Contributeur : Ronan Hamon <>
Soumis le : mardi 29 octobre 2013 - 15:34:58
Dernière modification le : samedi 17 septembre 2016 - 01:23:01
Document(s) archivé(s) le : vendredi 7 avril 2017 - 18:39:01
