23 search results - page 2 / 5 » Self-Stabilizing Minimum Spanning Tree Construction on Messa... |
GECCO
2009
Springer
14 years 10 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
PPSN
2010
Springer
13 years 4 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 ...
SODA
1998
ACM
13 years 7 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
MONET
2006
13 years 5 months ago
2006
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
AINA
2005
IEEE
13 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...