Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the maximum degree of minimum spanning trees
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
An approach to a problem in network design using genetic algorithms
An approach to a problem in network design using genetic algorithms
Approximation algorithms for some optimum communication spanning tree problems
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Network random keys: a tree representation scheme for genetic and evolutionary algorithms
Evolutionary Computation
A New Genetic Algorithm for the Optimal Communication Spanning Tree Problem
AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
Inoculation to Initialise Evolutionary Search
Selected Papers from AISB Workshop on Evolutionary Computing
A Linear Algorithm for the Hyper-Wiener Number of Chemical Trees
A Linear Algorithm for the Hyper-Wiener Number of Chemical Trees
A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Representations for Genetic and Evolutionary Algorithms
Representations for Genetic and Evolutionary Algorithms
Orientation matters: how to efficiently solve ocst problems with problem-specific EAs
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A memetic algorithm for the optimum communication spanning tree problem
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Edge sets: an effective evolutionary coding of spanning trees
IEEE Transactions on Evolutionary Computation
Solving OCST problems with problem-specific guided local search
Proceedings of the 12th annual conference on Genetic and evolutionary computation
New hybrid genetic algorithm for solving optimal communication spanning tree problem
Proceedings of the 2011 ACM Symposium on Applied Computing
| Hi-index | 0.00 |
This paper considers the Euclidean variant of the optimal communciation spanning tree (OCST) problem. Researches have analyzed the structure of the problem and found that high quality solutions prefer edges of low cost. Further, edges pointing to the center of the network are more likely to be included in good solutions. We add to the literature and provide additional insights into the structure of the OCST problem. Therefore, we investigate properies of the whole tree, such as node degrees and the Wiener index. The results reveal that optimal solutions are structured in a star-like manner. There are few nodes with high node degrees, these nodes are located next to the graph's center. The majority of the nodes have very low node degrees. Especially, nodes with degree one are very common and located far away of the center. We exploit these insights to develop a construction heuristic, which builds spanning trees with similar properties. Experiments indicate a high solution quality for the OCST problem. In a next step, we seed the initial population of an evolutionary algorithm (EA) with solutions constructed with our method. An experimental study demonstrates the merits of using a biased initialization: the algorithm is faster, better compared to the same algorithm using random starting solutions.