581 search results - page 102 / 117 » Approximation algorithms for constructing wavelength routing... |
158
click to vote
DCOSS
2008
Springer
15 years 3 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
109
click to vote
IPPS
2006
IEEE
15 years 7 months ago
2006
IEEE
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...
146
click to vote
FOCS
1995
IEEE
15 years 5 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
128
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
— We consider a dense wireless sensor network where the radio transceivers of the sensor nodes are heavily duty-cycled in order to conserve energy. The chief purpose of the senso...
107
click to vote
GC
2004
Springer
15 years 6 months ago
2004
Springer
This paper presents a locality-based dissemination graph algorithm for scalable reliable broadcast. Our algorithm scales in terms of both network and memory usage. Processes only h...