331 search results - page 47 / 67 » Approximation Algorithms for Connected Dominating Sets |
SODA
2007
ACM
15 years 1 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
106
click to vote
PODC
2011
ACM
14 years 2 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
111
click to vote
IPCO
2007
15 years 1 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
In ad hoc wireless networks, a successful broadcasting requires that the nodes forwarding the broadcast packet form a connected dominating set to ensure the coverage. An efficien...