Given a connected, weighted, undirected graph G and a bound D, the bounded diameter
minimum spanning tree problem seeks a spanning tree on G of minimum weight among the …

Given a wireless ad hoc network with a specified source node that has to broadcast
messages to all other nodes in the network, the minimum energy broadcast (MEB) problem …

The bounded diameter minimum spanning tree (BD-MST) problem seeks a spanning tree
(T) of minimum weight on a given connected, undirected and edge-weighted graph subject …

Given a connected, weighted, undirected graph G=(V, E), the bi-objective Minimum
Diameter-Cost Spanning Tree (bi-MDCST) Problem aims to find spanning trees on G with …

Motivated by some applications in communication networks of the diameter-constrained
minimum spanning tree (Diamc-MST) problem, we address the delay-constrained minimum …

Given a graph G and a bound d≥ 2, the bounded-diameter minimum spanning tree problem
seeks a spanning tree on G of minimum weight subject to the constraint that its diameter …

The node-depth encoding has elements from direct and indirect encoding for trees which
encodes trees by storing the depth of nodes in a list. Node-depth encoding applies specific …

In this paper, a new hybrid genetic algorithm-known as HGA-is proposed for solving the
Bounded Diameter Minimum Spanning Tree (BDMST) problem. We experiment with HGA on …

In this paper, we propose a new heuristic, called Center-Based Recursive Clustering-CBRC,
for solving the bounded diameter minimum spanning tree (BDMST) problem. Our proposed …

Due to the highly dynamicity and absence of a fixed infrastructure in wireless mobile ad hoc
networks (MANET), formation of a stable virtual backbone through which all the network …