44 search results - page 6 / 9 » Distributed Approximation of Capacitated Dominating Sets |
SC
2003
ACM
13 years 11 months ago
2003
ACM
We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. W...
ICDCS
2006
IEEE
14 years 7 hour ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
ICC
2009
IEEE
13 years 3 months ago
2009
IEEE
In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by...
EC
2002
13 years 5 months ago
2002
Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to nd a number of ...