570 search results - page 27 / 114 » Approximating Some Network Design Problems with Node Costs |
100
click to vote
ICALP
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
118
click to vote
ESA
2006
Springer
15 years 5 months ago
2006
Springer
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
129
click to vote
INFOCOM
2010
IEEE
14 years 11 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
114
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
130
click to vote
DIALM
2003
ACM
15 years 6 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...