A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On approximating a vertex cover for planar graphs

1982
*
Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82
*

The approximation problem for vertex cover of n-vertex planar graphs is treated. Two results are presented: (i) A linear time approximation algorithm for which the (error) performance bound is 2/3. (2) An 0(n log n) time approximation scheme. i. INTRODUCTION Let G(V,E) be a simple undirected graph. A subset of vertices is called a vertex cover if every edge has at least one endpoint in the subset. The vertex cover problem is, given G, find a vertex cover of minimum cardinality. The vertex cover

doi:10.1145/800070.802205
dblp:conf/stoc/Bar-YehudaE82
fatcat:nklxnmrwsfdsvdzfxvzw6wvtpq