Affiliation:
1. Polish Naval Academy, Poland
Abstract
Given an initial set of planar nodes, the problem is to build a minimum spanning tree connecting the maximum possible number of nodes by not exceeding the maximum edge length. To obtain a set of edges, a Delaunay triangulation is performed over the initial set of nodes. Distances between every pair of the nodes in respective edges are calculated used as graph weights. The edges whose length exceeds the maximum edge length are removed. A minimum spanning tree is built over every disconnected graph. The minimum spanning trees covering a maximum of nodes are selected, among which the tree whose length is minimal is the solution. It is 1.17 % shorter on average for 10 to 80 nodes compared to a nonselected tree.
Publisher
Riga Technical University
Reference41 articles.
1. [1] R. L. Graham and P. Hell, “On the history of the minimum spanning tree problem,” Annals of the History of Computing, vol. 7, no. 1, pp. 43–57, Jan.–Mar. 1985. https://doi.org/10.1109/MAHC.1985.10011
2. [2] H. Ahmadi and J. R. Martí, “Minimum-loss network reconfiguration: A minimum spanning tree problem,” Sustainable Energy, Grids and Networks, vol. 1, pp. 1 – 9, Mar. 2015. https://doi.org/10.1016/j.segan.2014.10.001
3. [3] B. Stojanović, T. Rajić, and D. Šošić, “Distribution network reconfiguration and reactive power compensation using a hybrid Simulated Annealing – Minimum spanning tree algorithm,” International Journal of Electrical Power & Energy Systems, vol. 147, May 2023, Art. no. 108829. https://doi.org/10.1016/j.ijepes.2022.108829
4. [4] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, “Chapter 23: Minimum Spanning Trees,” in Introduction to Algorithms, 2nd ed. MIT Press and McGraw-Hill, 2001, pp. 561–579.
5. [5] R. E. Tarjan, “Chapter 6. Minimum spanning trees. 6.2. Three classical algorithms,” Data Structures and Network Algorithms, in CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 44, Society for Industrial and Applied Mathematics, 1983, pp. 72 – 77.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献