209 search results - page 17 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
DCOSS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
ICPADS
2005
IEEE
15 years 3 months ago
2005
IEEE
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
STACS
2001
Springer
15 years 1 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
101
click to vote
AINA
2007
IEEE
15 years 3 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...
SODA
2004
ACM
14 years 10 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...