{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:46Z","timestamp":1761611266303},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_22","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T13:26:02Z","timestamp":1278336362000},"page":"250-261","source":"Crossref","is-referenced-by-count":32,"title":["Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems"],"prefix":"10.1007","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[]},{"given":"Subhash","family":"Khot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Khot, S.: An optimal long code test with one free bit. In: FOCS (2009)","DOI":"10.1109\/FOCS.2009.23"},{"issue":"3","key":"22_CR2","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0097539796302531","volume":"27","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs, and nonapproximability\u2014towards tight results. SIAM Journal on Computing\u00a027(3), 804\u2013915 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR3","unstructured":"Dinur, I., Guruswami, V., Khot, S.: Vertex cover on k-uniform hypergraphs is hard to approximate within factor (k\u2009\u2212\u20093\u2009\u2212\u2009\u03b5). In: Electronic Colloquium on Computational Complexity, Technical Report TR02-027 (2002)"},{"issue":"5","key":"22_CR4","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1137\/S0097539704443057","volume":"34","author":"I. Dinur","year":"2005","unstructured":"Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. SIAM Journal on Computing\u00a034(5), 1129\u20131146 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics\u00a0162(1) (2005) (Preliminary version in STOC 2002)","DOI":"10.4007\/annals.2005.162.439"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/226643.226652","volume":"43","author":"U. Feige","year":"1996","unstructured":"Feige, U., Goldwasser, S., Lov\u00e1sz, L., Safra, S., Szegedy, M.: Interactive proofs and the hardness of approximating cliques. Journal of the ACM\u00a043(2), 268\u2013292 (1996)","journal-title":"Journal of the ACM"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Garg, N., Kumar, A., Pandit, V.: Order scheduling models: Hardness and algorithms. In: FSTTCS, pp. 96\u2013107 (2007)","DOI":"10.1007\/978-3-540-77050-3_8"},{"key":"22_CR8","unstructured":"Goldreich, O.: Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs. ECCC Technical Report TR01-102 (2001)"},{"issue":"5","key":"22_CR9","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1137\/S0097539700381097","volume":"31","author":"E. Halperin","year":"2002","unstructured":"Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM Journal on Computing\u00a031(5), 1608\u20131623 (2002)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"22_CR10","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. Journal of ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"Journal of ACM"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1007\/3-540-45465-9_86","volume-title":"Automata, Languages and Programming","author":"J. Holmerin","year":"2002","unstructured":"Holmerin, J.: Improved inapproximability results for vertex cover on k-regular hyper-graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 1005\u20131016. Springer, Heidelberg (2002)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Holmerin, J.: Vertex cover on 4-regular hyper-graphs is hard to approximate within 2\u2009\u2212\u2009\u03b5. In: Proc. 34th ACM Symp. on Theory of Computing (STOC), pp. 544\u2013552 (2002)","DOI":"10.1145\/509907.509986"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1007\/11523468_84","volume-title":"Automata, Languages and Programming","author":"G. Karakostas","year":"2005","unstructured":"Karakostas, G.: A better approximation ratio for the vertex cover problem. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1043\u20131050. Springer, Heidelberg (2005)"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. 34th ACM Symposium on Theory of Computing (2002)","DOI":"10.1145\/509907.510017"},{"issue":"3","key":"22_CR15","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S. Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci.\u00a074(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Leung, J., Li, H., Pinedo, M.: Order scheduling models: an overview. In: Multidisciplinary Scheduling: Theory and Applications, pp. 37\u201356 (2003)","DOI":"10.1007\/0-387-27744-7_3"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1016\/j.dam.2006.09.012","volume":"155","author":"J.Y.T. Leung","year":"2007","unstructured":"Leung, J.Y.T., Li, H., Pinedo, M.: Scheduling orders for multiple product types to minimize total weighted completion time. Discrete Appl. Math.\u00a0155, 945\u2013970 (2007)","journal-title":"Discrete Appl. Math."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Mastrolilli, M., Queyranne, M., Schulz, A.S., Svensson, O., Uhan, N.A.: Minimizing the sum of weighted completion times in a concurrent open shop. Preprint (2009)","DOI":"10.1016\/j.orl.2010.04.011"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Mossel, E.: Gaussian bounds for noise correlation of functions. To Appear in GAFA. Current version on arxiv\/math\/0703683 (2009)","DOI":"10.1109\/FOCS.2008.44"},{"key":"22_CR20","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/opre.43.2.346","volume":"43","author":"C.N. Potts","year":"1995","unstructured":"Potts, C.N., Sevastianov, S.V., Strusevish, V.A., Van Wassenhove, L.N., Zwaneveld, C.M.: The two-stage assembly scheduling problem: Complexity and approximation. Operations Research\u00a043, 346\u2013355 (1995)","journal-title":"Operations Research"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<203::AID-JOS26>3.0.CO;2-5","volume":"2","author":"P. Schuurman","year":"1999","unstructured":"Schuurman, P., Woeginger, G.J.: Polynomial time approximation algorithms for machine scheduling: ten open problems. Journal of Scheduling\u00a02, 203\u2013213 (1999)","journal-title":"Journal of Scheduling"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proc. 33rd ACM Symp. on Theory of Computing (STOC), pp. 453\u2013461 (2001)","DOI":"10.1145\/380752.380839"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T22:41:27Z","timestamp":1685659287000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}