{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T23:12:19Z","timestamp":1780096339756,"version":"3.54.0"},"reference-count":17,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2003.1214437","type":"proceedings-article","created":{"date-parts":[[2004,1,23]],"date-time":"2004-01-23T23:33:03Z","timestamp":1074900783000},"page":"379-386","source":"Crossref","is-referenced-by-count":60,"title":["Vertex cover might be hard to approximate to within 2-\u03b5"],"prefix":"10.1109","author":[{"given":"S.","family":"Khot","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"O.","family":"Regev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700381097"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258536"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"ref13","article-title":"Improved inapproximability results for vertex cover on k-regular hyper-graphs","author":"holmerin","year":"2002","journal-title":"International Colloquium on Automata Languages and Programming (ICALP)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509986"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1145\/509907.510017","article-title":"On the power of unique 2-Prover 1-Round games","author":"khot","year":"2002","journal-title":"Proc ACM Symp on Theory of Computing (STOC)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF00537230"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380839"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780629"},{"key":"ref3","article-title":"Vertex cover on k-uniform hypergraphs is hard to approximate within factor (k ? 3 - ?)","author":"dinur","year":"2002","journal-title":"Electronic Colloquium on Computational Complexity Technical Report TR02–027"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185341"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509915"},{"key":"ref8","article-title":"Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hyper-graphs","author":"goldreich","year":"2001","journal-title":"ECCC technical report TR01–82"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009809"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796302531"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181954"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892074"}],"event":{"name":"18th IEEE Annual Conference on Computational Complexity","location":"Aarhus, Denmark","acronym":"CCC-03"},"container-title":["18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8614\/27296\/01214437.pdf?arnumber=1214437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T15:40:17Z","timestamp":1682610017000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1214437\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/ccc.2003.1214437","relation":{},"subject":[]}}