616 search results - page 26 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
ADHOCNETS
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we consider the use of multiple mobile software agents to perform different tasks in wireless sensor networks (WSNs). To this regard, determining the number of mobil...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
AINA
2007
IEEE
14 years 1 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
AINA
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor n...
EUROPAR
2004
Springer
14 years 28 days ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...