166 search results - page 18 / 34 » A fast distributed approximation algorithm for minimum spann... |
148
Voted
SODA
1992
ACM
15 years 3 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
154
Voted
AINA
2005
IEEE
15 years 8 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...
118
click to vote
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
117
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
118
Voted
IPPS
2010
IEEE
15 years 15 days ago
2010
IEEE
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...