174 search results - page 2 / 35 » Dispersion in Unit Disks |
WG
2004
Springer
13 years 11 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...
STOC
1996
ACM
13 years 10 months ago
1996
ACM
If disks are moved so that each center
APPROX
2006
Springer
13 years 9 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...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that -precision graphs are planar for > 1/ 2 and give a dichotomy theorem f...
WG
2010
Springer
13 years 4 months ago
2010
Springer
We prove that for sufficiently large n, there exist unit disk graphs on n vertices such that for every representation with disks in the plane at least c √ n bits are needed to wr...