TY - JOUR
T1 - Finding bounded diameter minimum spanning tree in general graphs
AU - Segal, Michael
AU - Tzfaty, Oren
N1 - Funding Information:
The authors thank anonymous reviewers whose comments greatly improved the presentation of the paper.
Publisher Copyright:
© 2022 Elsevier Ltd
PY - 2022/8/1
Y1 - 2022/8/1
N2 - Given a connected, weighted, undirected graph G=(V,E) and a constant D≥2, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of minimum weight with diameter no more than D. A new algorithm addresses graphs with non-negative weights and has proven performance ratio of [Formula presented], where w+ (resp. w−) denotes the maximum (resp. minimum) edge weight in the graph, and dmin is the hop diameter of G. The running time of the algorithm is O|V|logD after minimum spanning tree of G is computed. The performance of the algorithm has been evaluated empirically as well.
AB - Given a connected, weighted, undirected graph G=(V,E) and a constant D≥2, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of minimum weight with diameter no more than D. A new algorithm addresses graphs with non-negative weights and has proven performance ratio of [Formula presented], where w+ (resp. w−) denotes the maximum (resp. minimum) edge weight in the graph, and dmin is the hop diameter of G. The running time of the algorithm is O|V|logD after minimum spanning tree of G is computed. The performance of the algorithm has been evaluated empirically as well.
KW - Bounded diameter minimum spanning tree
KW - Graph theory
KW - Minimum spanning tree
UR - http://www.scopus.com/inward/record.url?scp=85129266419&partnerID=8YFLogxK
U2 - 10.1016/j.cor.2022.105822
DO - 10.1016/j.cor.2022.105822
M3 - Article
AN - SCOPUS:85129266419
SN - 0305-0548
VL - 144
JO - Computers and Operations Research
JF - Computers and Operations Research
M1 - 105822
ER -