Efficient determination of the k most vital edges for the minimum spanning tree problem

• Stopping condition redesigned (integrated with the exploration/exploitation strategy and based on the interest of the search and diversity of new solutions). ACOv3f: algorithm

Given an undirected labeled connected graph (i.e., with a label or color for each edge), the minimum labeling spanning tree problem seeks a spanning tree whose edges have the smallest

This algorithm combines an original crossover based on the union of independent sets proposed in [1] and local search techniques dedicated to the minimum sum coloring problem

In conclusion, the composition of these four layers provides us a self-stabilizing algorithm for centers computation or minimum diameter spanning tree construc- tion under

Moreover, when used for xed classes G of graphs having optimum (APSPs) compact routing schemes, the construction of an MDST of G ∈ G may be performed by using interval, linear

• If there is no outgoing edge, that means that the maximum degree of this spanning tree cannot be improved, this node send a message ”stop” to its parents.. The ”stop” message

In this paper, we propose a distributed version of Fischer’s ap- proximation algorithm that computes a minimum weight spanning tree of de- gree at most b∆ ∗ + ⌈log b n⌉, for

Next, we also want to point out that the nonlinear theory yields interesting and difficult new problems. There are many interesting examples, for instance in multi- phase