Finding bounded diameter minimum spanning tree in general graphs

Michael Segal, Oren Tzfaty

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Article number105822
JournalComputers and Operations Research
StatePublished - 1 Aug 2022


  • Bounded diameter minimum spanning tree
  • Graph theory
  • Minimum spanning tree

ASJC Scopus subject areas

  • Computer Science (all)
  • Modeling and Simulation
  • Management Science and Operations Research


Dive into the research topics of 'Finding bounded diameter minimum spanning tree in general graphs'. Together they form a unique fingerprint.

Cite this