599 search results - page 20 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
AAIM
2007
Springer
15 years 5 months ago
2007
Springer
111
click to vote
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
107
click to vote
IWDC
2005
Springer
15 years 5 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
111
click to vote
COLOGNETWENTE
2010
14 years 10 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
102
click to vote
ICDCS
2008
IEEE
15 years 6 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...