3 search results - page 1 / 1 » A Kruskal-Based Heuristic for the Rooted Delay-Constrained M... |
170
Voted
PPSN
2010
Springer
15 years 3 months ago
2010
Springer
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 ...
179
Voted
AINA
2005
IEEE
15 years 11 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...