Work

Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP

Year: 2001

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.cs/0110025

Authors: Hemaspaandra, Edith, Rothe, Jörg, Spakowski, Holger

Institutions: Rochester Institute of Technology, Heinrich Heine University Düsseldorf

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Deutscher Akademischer Austauschdienst, Deutsche Forschungsgemeinschaft

Awards: U.S. - Germany Cooperative Research: Parallel Access to NP: Complexity and Applicability, Complexity of Logics, G7610357756

OpenAlex ID: W2952335282

Cites: 14

Cited by: 3

Related to: 20