An Intelligent and Flexible Solution for the Balanced Spanning Tree Problem
Marzieh Hajizadeh Tahan, Mohammad Ghasemzadeh · 2019
Construction of Balanced Spanning Tree is one of the problems in computer science with many applications such as in communications and social networks. A balanced spanning tree is obtained through a trade-off between finding the minimum spanning tree and the shortest path tree in a graph. Already some methods are presented for this problem; in this research work, we discuss the advantages and shortcomings of each one and then we present a new flexible intelligent method which is based on multiobjective genetic programming.