arXiv · cs/0110025
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP
Abstract
For both the edge deletion heuristic and the maximum-degree greedy heuristic, we study the problem of recognizing those graphs for which that heuristic can approximate the size of a minimum vertex cover within a constant factor of r, where r is a fixed rational number. Our main results are that these problems are complete for the class of problems solvable via parallel access to NP. To achieve these main results, we also show that the restriction of the vertex cover problem to those graphs for which either of these heuristics can find an optimal solution remains NP-hard.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Edith Hemaspaandra, Jörg Rothe, Holger Spakowski. 2005-01-25. Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. https://searcharxiv.com/abs/cs/0110025
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.