| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435350 | Theoretical Computer Science | 2009 | 5 Pages |
Abstract
This paper gives the first polynomial time approximation scheme for the connected vertex cover problem in unit disk graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
