144 search results - page 1 / 29 » Unit disk graph approximation |
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...
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
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...
WG
2005
Springer
13 years 9 months ago
2005
Springer
DIALM
2004
ACM
13 years 9 months ago
2004
ACM
