Affiliation:
1. DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE TECHNICAL UNIVERSITY OF CLUJ-NAPOCA NORTH UNIVERSITY CENTRE AT BAIA MARE
Abstract
The clustered shortest-path tree problem is an extension of the classical single-source shortest-path problem, in which, given a graph with the set of nodes divided into a redefined, mutually exclusive and exhaustive set of clusters, we want to determine a shortest-path spanning tree from a given source to all the other nodes of the graph, with the property that each cluster should induce a connected subtree. The investigated problem proved to be NP-hard and therefore we proposed an efficient genetic algorithm in order to solve it. The preliminary computational results reported on a set of benchmark instances from the literature proved that our proposed solution approach yields high-quality solutions within reasonable running times.
Publisher
Technical University of Cluj Napoca, North University Center of Baia Mare
Reference18 articles.
1. [1] Binh, H. T. T., Thanh, P. D., Trung, T.B. and Thao, L. P., Effective multifactorial evolutionary algorithm for solving the cluster shortest path tree problem, in Proc. of IEEE Congress on Evolutionary Computation (CEC), pp. 819–826, 2018
2. [2] Binh, H. T. T., Thanh, P. D. and Thang, T. B., New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm, Knowledge-Based Systems, 180 (2019), 12–25
3. [3] Demange, M., Monnot, J., Pop, P. C. and Ries, B., On the complexity of the selective graph coloring problem in some special classes of graphs, Theor. Comput. Sci., 540-541 (2014), 82–102
4. [4] D’Emidio, M., Forlizzi, L., Frigioni, D., Leucci, S. and Proietti, G., On the clustered shortest-path tree problem, in Proc. of Italian Conference on Theoretical Computer Science, pp. 263–268, 2016
5. [5] D’Emidio, M., Forlizzi, L., Frigioni, D., Leucci, S. and Proietti, G., Hardness, approximability and fixedparameter tractability of the clustered shortest-path tree problem, J. Comb. Optim., 38 (2019), 165–184
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献