Sciweavers

599 search results - page 12 / 120
» Approximation Algorithms for Dominating Set in Disk Graphs
Sort
View
SODA
2003
ACM
96views Algorithms» more  SODA 2003»
13 years 9 months ago
Dominating sets in planar graphs: branch-width and exponential speed-up
Fedor V. Fomin, Dimitrios M. Thilikos
HICSS
2002
IEEE
132views Biometrics» more  HICSS 2002»
14 years 18 days ago
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
11 years 10 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
MOBIHOC
2008
ACM
14 years 7 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li