599 search results - page 11 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
WAW
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we study the size of generalised dominating sets in two graph processes which are widely used to model aspects of the world-wide web. On the one hand, we show that gr...
JCO
2010
13 years 6 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
WG
2005
Springer
14 years 1 months ago
2005
Springer
DIALM
2004
ACM
14 years 1 months ago
2004
ACM
ESA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of