137 search results - page 1 / 28 » Parameterized approximation of dominating set problems |
84
Voted
IPL
2008
14 years 10 months ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...
113
Voted
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
73
Voted
IWPEC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We introduce a general notion of miniaturization of a problem that comprises the different miniaturizations of concrete problems considered so far. We develop parts of t...
98
Voted
JCO
2008
14 years 10 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
87
Voted
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...