Sciweavers

Share
114 search results - page 1 / 23
» Approximation Algorithms for Unit Disk Graphs
Sort
View
WG
2004
Springer
10 years 9 months ago
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
Tim Nieberg, Johann Hurink, Walter Kern
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
10 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ú...
DIALM
2004
ACM
121views Algorithms» more  DIALM 2004»
10 years 9 months ago
Unit disk graph approximation
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ALGORITHMICA
2006
161views more  ALGORITHMICA 2006»
10 years 4 months ago
The Expected Size of the Rule k Dominating Set
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
Jennie C. Hansen, Eric Schmutz, Li Sheng
books