Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP
Work
Year: 1998
Type: article
Abstract: Bodlaender, Thilikos, and Yamazaki (1997) investigate the computational complexity of the problem of whether the Minimum Degree Greedy Algorithm can approximate a maximum independent set of a graph wi... more
Source: Information Processing Letters
Authors Edith Hemaspaandra, Jörg Rothe
Institutions Le Moyne College, Friedrich Schiller University Jena
Cites: 11
Cited by: 30
Related to: 10
FWCI: 2.185
Citation percentile (by year/subfield): 80.48
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,200