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
Contributor : Ronan Hamon
<>
Submitted on : Tuesday, October 29, 2013 - 3:34:58 PM
Last modification on : Wednesday, November 20, 2019 - 3:14:59 AM
Long-term archiving on: Friday, April 7, 2017 - 6:39:01 PM
