Future Generation Computer Systems
Coloured Ant System and Local Search to Design Local Telecommunication Networks
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Spanning Trees with Bounded Number of Branch Vertices
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Ant Colony Optimization
An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem
Applied Soft Computing
Bounded-degree spanning tree problems: models and new algorithms
Computational Optimization and Applications
A swarm intelligence approach to the quadratic minimum spanning tree problem
Information Sciences: an International Journal
Ant colony optimisation to identify genetic variant association with type 2 diabetes
Information Sciences: an International Journal
A novel ant-based clustering algorithm using the kernel method
Information Sciences: an International Journal
Information Sciences: an International Journal
A multi-level ant-colony mining algorithm for membership functions
Information Sciences: an International Journal
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Light trees: optical multicasting for improved performance in wavelength routed networks
IEEE Communications Magazine
Hi-index | 0.07 |
A vertex v of a connected graph G=(V,E) is called a branch vertex if its degree is greater than two. Pertaining to branch vertices, this paper studies two optimization problems having roots in the domain of optical networks. The first one, referred to as MBV, seeks a spanning tree T of G with the minimum number of branch vertices, whereas the second problem, referred to as MDS, seeks a spanning tree T of G with the minimum degree sum of branch vertices. Both MBV and MDS are NP-Hard. Two heuristics approaches are presented for each problem. The first approach is a problem specific heuristic, whereas the latter one is a hybrid ant-colony optimization algorithm. Computational results show the effectiveness of our proposed approaches.