Finding bounded diameter minimum spanning tree in general graphs

Michael Segal; Oren Tzfaty

doi:10.1016/j.cor.2022.105822

Finding bounded diameter minimum spanning tree in general graphs

Michael Segal, Oren Tzfaty

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

Abstract

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 d_min 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.

Original language	American English
Article number	105822
Journal	Computers and Operations Research
Volume	144
DOIs	https://doi.org/10.1016/j.cor.2022.105822
State	Published - 1 Aug 2022

Keywords

Bounded diameter minimum spanning tree
Graph theory
Minimum spanning tree

All Science Journal Classification (ASJC) codes

General Computer Science
Modelling and Simulation
Management Science and Operations Research

Access to Document

10.1016/j.cor.2022.105822

Cite this

@article{f673977837f64dac9e166e831a18c803,

title = "Finding bounded diameter minimum spanning tree in general graphs",

abstract = "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.",

keywords = "Bounded diameter minimum spanning tree, Graph theory, Minimum spanning tree",

author = "Michael Segal and Oren Tzfaty",

note = "Publisher Copyright: {\textcopyright} 2022 Elsevier Ltd",

year = "2022",

month = aug,

day = "1",

doi = "10.1016/j.cor.2022.105822",

language = "American English",

volume = "144",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd.",

}

TY - JOUR

T1 - Finding bounded diameter minimum spanning tree in general graphs

AU - Segal, Michael

AU - Tzfaty, Oren

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

SN - 0305-0548

VL - 144

JO - Computers and Operations Research

JF - Computers and Operations Research

M1 - 105822

ER -

Finding bounded diameter minimum spanning tree in general graphs

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this