114 search results - page 1 / 23 » Approximation Algorithms for Unit Disk Graphs |
WG
2004
Springer
13 years 9 months ago
2004
Springer
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...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
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...
WG
2005
Springer
13 years 10 months ago
2005
Springer
DIALM
2004
ACM
13 years 10 months ago
2004
ACM
ALGORITHMICA
2006
13 years 4 months ago
2006
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...