Sciweavers

3 search results - page 1 / 1
» A Kruskal-Based Heuristic for the Rooted Delay-Constrained M...
Sort
View
135
Voted
EUROCAST
2009
Springer
190views Hardware» more  EUROCAST 2009»
15 years 7 months ago
A Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Mario Ruthmair, Günther R. Raidl
125
Voted
PPSN
2010
Springer
14 years 11 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
135
Voted
AINA
2005
IEEE
15 years 6 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
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...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko