We consider the Bounded Diameter Minimum Spanning Tree problem and describe four
neighbourhood searches for it. They are used as local improvement strategies within a …

The bounded diameter minimum spanning tree problem is an NP-hard combinatorial
optimization problem with applications in various fields like communication network design …

We consider the intractable problem of finding several edge-disjoint spanning trees of the
minimum total weight with a given diameter in complete undirected graph in current paper …

Das Finden eines durchmesserbeschränkten minimale Spannbaumes (BDMST) ist ein
kombinatorisches Optimierungsproblem aus dem Bereich des Netzwerkdesigns und hat …

Рассматривается труднорешаемая задача поиска нескольких
ребернонепересекающихся (разнореберных) остовных деревьев минимального …

The d-Dim h-hops MST problem is defined as follows: Given a set S of points in the d-
dimensional Euclidean space and s∈ S, find a minimum-cost spanning tree for S rooted at s …

This study presents the formal problem definition and computational analysis of the network
design improvements for idea and message propagation in both enterprise and consumer …

We consider the following NP-hard problem. Given an undirected complete edge-weighted
graph and positive integers m, D, the goal is to find m edge-disjoint spanning trees with …

The d-Dimh-hops MST problem is defined as follows: given a set S of points in the d-
dimensional Euclidean space and s∈ S, find a minimum-cost spanning tree for S rooted at s …

We consider the following NP-hard problem. Given an undirected complete edge-weighted
graph and positive integers m, D, the goal is to find m edge-disjoint spanning trees with …