Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP

Author: Hemaspaandra Edith   Rothe Jörg   Spakowski Holger  

Publisher: Edp Sciences

E-ISSN: 1290-385x|40|1|75-91

ISSN: 0988-3754

Source: RAIRO - Theoretical Informatics and Applications, Vol.40, Iss.1, 2010-03, pp. : 75-91

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract