Mugang Lin1,2,*, Fangju Liu3, Huihuang Zhao1,2, Jianzhen Chen1,2
CMES-Computer Modeling in Engineering & Sciences, Vol.125, No.1, pp. 197-214, 2020, DOI:10.32604/cmes.2020.09502
- 18 September 2020
Abstract Given a connected undirected graph G whose edges are labeled, the
minimum labeling spanning tree (MLST) problem is to find a spanning tree of G with the smallest number of different labels. The MLST is an NP-hard combinatorial optimization problem, which is widely applied in communication
networks, multimodal transportation networks, and data compression. Some
approximation algorithms and heuristics algorithms have been proposed for
the problem. Firey algorithm is a new meta-heuristic algorithm. Because
of its simplicity and easy implementation, it has been successfully applied in
various fields. However, the basic firefly algorithm for the MLST problem More >
Login
Register
