Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
SIAM Journal on Computing
Data Structures and Algorithms
Data Structures and Algorithms
Representations for Genetic and Evolutionary Algorithms
Representations for Genetic and Evolutionary Algorithms
An Effective Implementation of a Direct Spanning Tree Representation in GAs
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A New Genetic Algorithm for the Optimal Communication Spanning Tree Problem
AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
Edge sets: an effective evolutionary coding of spanning trees
IEEE Transactions on Evolutionary Computation
Some novel locality results for the blob code spanning tree representation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Parallel algorithms for encoding and decoding blob code
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Hi-index | 0.00 |
Among the many codings of spanning trees for evolutionary search are those based on bijections between Prüfer strings---strings of n-2 vertex labels---and spanning trees on the labeled vertices. One of these bijections, called the Blob Code, showed promise as an evolutionary coding, but EAs that use it to represent spanning trees have not performed well. Here, a genetic algorithm that represents spanning trees via the Blob Code is faster than, and returns results competitive with those of, a GA that encodes spanning trees as edge-sets on Euclidean instances of the minimum routing cost spanning tree problem. On instances whose edge weights have been chosen at random, the Blob-coded GA maintains its time advantage, but its results are inferior to those of the edge-set-coded GA, and both GAs are hard pressed to keep up with a simple stochastic hill-climber on all the test instances.