1480 search results - page 239 / 296 » Distributed algorithms for weighted problems in sparse graph... |
134
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
243
click to vote
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
120
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
129
click to vote
SOCIALCOM
2010
15 years 1 months ago
2010
Multiple phenomena often diffuse through a social network, sometimes in competition with one another. Product adoption and political elections are two examples where network diffus...
139
click to vote
ASPDAC
2006
ACM
15 years 9 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...