We study a mobile wireless sensor network (MWSN) consisting of multiple mobile sensors or
robots. Three key factors in MWSNs, such as sensing quality, energy consumption, and …

Abstract The Minimum Spanning Tree problem aims to create a subset of a graph where all
the vertices are connected with the minimum edge weights and with no cycle. In this field, an …

The minimum routing cost tree problem arises when we need to find the tree minimizing the
minimum travel/communication cost, ie, the tree which presents the minimal difference with …

Given a connected, weighted, and undirected graph, the minimum routing cost spanning
tree problem seeks a spanning tree of minimum routing cost on this graph, where routing …

Given an edge-weighted graph G=(V, E) with vertex set V and edge set E, we study in this
paper the following related balanced tree structure problems in G. The first problem, called …

Content-based publish/subscribe has gained high popularity for large-scale dissemination
of dynamic content. Yet it is highly challenging to enable communication-efficient …

Minimum Routing Cost Spanning Tree (MRCT) is one of spanning tree optimization
problems having several applications in network design. In general case, the problem is …

In this paper, least-cost minimum spanning tree (LC-MST) problem is defined as a method to
construct a minimum cost spanning tree that has the least-cost edges in the network by …

Spanning tree problems with specialized constraints can be difficult to solve in real-world
scenarios, often requiring intricate algorithmic design and exponential time. Recently, there …

Clustering is a branch of multivariate analysis that is used to create groups of data. Most of
the existing clustering techniques require defining additional information, including the …