Sciweavers

406 search results - page 5 / 82
» Dominating Sets in Web Graphs
Sort
View
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 7 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
ESA
2009
Springer
131views Algorithms» more  ESA 2009»
15 years 10 months ago
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
Geevarghese Philip, Venkatesh Raman, Somnath Sikda...
70
Voted
SODA
2003
ACM
96views Algorithms» more  SODA 2003»
15 years 4 months ago
Dominating sets in planar graphs: branch-width and exponential speed-up
Fedor V. Fomin, Dimitrios M. Thilikos