Untitled
Work
Year: 2011
Type: article
Abstract: We study the inapproximability of Vertex Cover and Independent Set on degree-d graphs.We prove that:This exactly matches the algorithmic result of Halperin (SICOMP'02) up to the o d (1) term.• Indepen... more
Source: Theory of Computing
Authors Per Austrin, Subhash Khot, Muli Safra
Cites: 20
Cited by: 55
Related to: 10
FWCI: 5.534
Citation percentile (by year/subfield): 99.99
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid