39 search results - page 2 / 8 » Approximation Algorithms for Some Optimum Communication Span... |
NETWORKING
2007
13 years 6 months ago
2007
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
CPAIOR
2010
Springer
13 years 10 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
SODA
1998
ACM
13 years 6 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...
JDA
2007
13 years 5 months ago
2007
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
ASIAMS
2007
IEEE
13 years 11 months ago
2007
IEEE
The tree structure has received much interest as a versatile architecture for a large class of parallel processing applications. Spanning trees in particular are essential tools f...