Conference Proceedings

On approximating a vertex cover for planar graphs

Proceedings of the Annual ACM Symposium on Theory of Computing (1982) 303-309
DOI: 10.1145/800070.802205
38Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The approximation problem for vertex cover of n-vertex planar graphs is treated. Two results are presented: (1) A linear time approximation algorithm for which the (error) performance bound is 2/3. (2) An O(n log n) time approximation scheme.

Cite

CITATION STYLE

APA

Bar-Yehuda, R., & Even, S. (1982). On approximating a vertex cover for planar graphs. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 303–309). Association for Computing Machinery. https://doi.org/10.1145/800070.802205

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free