79 search results - page 1 / 16 » Minimum Dominating Set Approximation in Graphs of Bounded Ar... |
242
click to vote
WDAG
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
227
click to vote
COLOGNETWENTE
2007
15 years 9 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
248
click to vote
PROPERTYTESTING
2010
15 years 5 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
214
click to vote
ISAAC
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
210
click to vote
ESA
2001
Springer
16 years 4 days ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...