209 search results - page 23 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
103
click to vote
AINA
2005
IEEE
15 years 3 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
STOC
2003
ACM
15 years 9 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...
86
Voted
PDCAT
2004
Springer
15 years 2 months ago
2004
Springer
Recent works have classified de Bruijn graph (dBG) based broadcasting algorithms into local broadcasting and arc-disjoint spanning trees based broadcasting. However, those algorit...
ISPDC
2010
IEEE
14 years 7 months ago
2010
IEEE
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...
PDCAT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...