Vertex cover might be hard to approximate to within 2 - ε
From Thermodynamics of Computation
- reference groups
- Computer Science Theory
- author-supplied keywords
- Hardness of approximation
- Unique games conjecture
- Vertex cover
- keywords
- authors
- Subhash Khot
- Oded Regev
- title
- Vertex cover might be hard to approximate to within 2 - ε
- type
- journal
- year
- 2008
- source
- Journal of Computer and System Sciences
- pages
- 335-349
- volume
- 74
- issue
- 3
- publisher
- Academic Press Inc.
- link
- https://www.mendeley.com/catalogue/b4c5305d-f699-3d2c-8a06-b2328aeb2a76/(0)
Counts
- Citation count
- 493
- Page views
- 0
Identifiers
- doi: 10.1016/j.jcss.2007.06.019 (Google search)
- issn: 10902724
- sgr: 38149105774
- scopus: 2-s2.0-38149105774
- pui: 351105796
