Sciweavers

331 search results - page 9 / 67
» Approximation Algorithms for Connected Dominating Sets
Sort
View
MST
2010
187views more  MST 2010»
14 years 6 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
JPDC
2007
112views more  JPDC 2007»
14 years 11 months ago
Distributed algorithms for connected domination in wireless networks
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CD...
Rajiv Gandhi, Srinivasan Parthasarathy 0002
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
15 years 5 months ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh
PDPTA
2004
15 years 1 months ago
A New Adaptive Distributed Routing Protocol Using d-hop Dominating Sets for Mobile Ad Hoc Networks
In this paper, we propose an adaptive self- stabilizing algorithm for producing a d-hop connected d-hop dominating set. In the algorithm, the set is cumulatively built with commun...
Zhengnan Shi, Pradip K. Srimani
RSKT
2007
Springer
15 years 5 months ago
Optimized Generalized Decision in Dominance-Based Rough Set Approach
Dominance-based Rough Set Approach (DRSA) has been proposed to deal with multi-criteria classification problems, where data may be inconsistent with respect to the dominance princ...
Krzysztof Dembczynski, Salvatore Greco, Wojciech K...