We formulate and computationally test several models for the Diameter‐Constrained
Minimum Spanning and Steiner Tree Problems, which seek a least‐cost spanning or Steiner …

A minimum spanning tree (MST) with a small diameter is required in numerous practical
situations such as when distributed mutual-exclusion algorithms are used, or when …

A minimum spanning tree (MST) with a small diameter is required in numerous practical
situations. It is needed, for example, in distributed mutual exclusion algorithms in order to …

In the complete graph on n vertices, when each edge has a weight which is an exponential
random variable, Frieze proved that the minimum spanning tree has weight tending to ζ (3) …

In a previous article, using underlying graph theoretical properties, Gouveia and Magnanti
(2003) described several network flow‐based formulations for diameter‐constrained tree …

The diameter of a tree is a measure of the longest path between any two nodes in the tree
where this path is defined in terms of the number of edges. A Diameter-Constrained …

The diameter-constrained minimum spanning tree problem is an NP-hard combinatorial
optimization problem that seeks a minimum cost spanning tree with a limit D imposed upon …

In a previous paper, Gouveia and Magnanti (2003) found diameter-constrained minimal
spanning and Steiner tree problems to be more difficult to solve when the tree diameter D is …

In numerous practical applications, it is necessary to find the smallest possible tree with a
bounded diameter. A diameter-constrained minimum spanning tree (DCMST) of a given …

The Diameter-Constrained Minimum Spanning Tree Problem seeks a least cost spanning
tree subject to a (diameter) bound imposed on the number of edges in the tree between any …