Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An Inherently Parallel Method for Heuristic Problem-Solving: Part II-Example Applications
IEEE Transactions on Parallel and Distributed Systems
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Journal of Discrete Algorithms
Complexity and approximation results for the connected vertex cover problem
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Minimum vertex cover in rectangle graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
ACM Transactions on Algorithms (TALG)
Flip distance between triangulations of a planar point set is APX-hard
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
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.