581 search results - page 77 / 117 » Approximation algorithms for constructing wavelength routing... |
120
click to vote
IPSN
2010
Springer
15 years 8 months ago
2010
Springer
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
101
click to vote
DC
2010
15 years 1 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...
108
click to vote
STOC
2006
ACM
16 years 1 months ago
2006
ACM
In this paper, we present a simple distributed algorithm for resource allocation which simultaneously approximates the optimum value for a large class of objective functions. In p...
130
click to vote
SPAA
2004
ACM
15 years 6 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
128
click to vote
COMCOM
2007
15 years 1 months ago
2007
In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as...