Sciweavers

Share
144 search results - page 1 / 29
» Unit disk graph approximation
Sort
View
WG
2004
Springer
10 years 8 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 6 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ú...
COCOA
2008
Springer
10 years 4 months ago
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
Zhao Zhang, Xiaofeng Gao, Weili Wu
DIALM
2004
ACM
121views Algorithms» more  DIALM 2004»
10 years 8 months ago
Unit disk graph approximation
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
books