{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:49Z","timestamp":1725558949851},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642141645"},{"type":"electronic","value":"9783642141652"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_31","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:02Z","timestamp":1278321962000},"page":"360-371","source":"Crossref","is-referenced-by-count":5,"title":["On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs"],"prefix":"10.1007","author":[{"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[]},{"given":"Rishi","family":"Saket","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"31_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01844843","volume":"16","author":"R. Aharoni","year":"1996","unstructured":"Aharoni, R., Holzman, R., Krivelevich, M.: On a theorem of Lov\u00e1sz on covers in r-partite hypergraphs. Combinatorica\u00a016(2), 149\u2013174 (1996)","journal-title":"Combinatorica"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Austrin, P., Mossel, E.: Approximation resistant predicates from pairwise independence. In: IEEE Conference on Computational Complexity, pp. 249\u2013258 (2008)","DOI":"10.1109\/CCC.2008.20"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Khot, S.: Inapproximability of hypergraph vertex cover and applications to scheduling problems. In: Proceedings of ICALP (July 2009)","DOI":"10.1007\/978-3-642-14165-2_22"},{"key":"31_CR4","unstructured":"Dinur, I., Guruswami, V., Khot, S.: Vertex cover on k-uniform hypergraphs is hard to approximate within factor (k-3-\u03b5). ECCC Technical Report TR02-027 (2002)"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Dinur, I., Guruswami, V., Khot, S., Regev, O.: A new multilayered PCP and the hardness of hypergraph vertex cover. In: Proc. 35\n                    th\n                   ACM STOC, pp. 595\u2013601 (2003)","DOI":"10.1145\/780542.780629"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Dinur, I., Safra, S.: The importance of being biased. In: Proc. 34\n                    th\n                   ACM STOC, pp. 33\u201342 (2002)","DOI":"10.1145\/509907.509915"},{"key":"31_CR7","unstructured":"Feder, T., Motwani, R., O\u2019Callaghan, L., Panigrahy, R., Thomas, D.: Online distributed predicate evaluation. Technical Report, Stanford University (2003)"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Senellart, P.: Schema mapping discovery from data instances. J. ACM\u00a057(2) (January 2010)","DOI":"10.1145\/1667053.1667055"},{"issue":"5","key":"31_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 J. Comput.\u00a031(5), 1608\u20131623 (2002)","journal-title":"SIAM J. Comput."},{"key":"31_CR10","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 -uniform hypergraphs. 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":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/11496656_27","volume-title":"Combinatorial Pattern Matching","author":"L. Ilie","year":"2005","unstructured":"Ilie, L., Solis-Oba, R., Yu, S.: Reducing the size of NFAs by using equivalences and preorders. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 310\u2013321. Springer, Heidelberg (2005)"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proc. 34\n                    th\n                   ACM STOC, pp. 767\u2013775 (2002)","DOI":"10.1145\/509907.510017"},{"issue":"1","key":"31_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S. Khot","year":"2007","unstructured":"Khot, S., Kindler, G., Mossel, E., O\u2019Donnell, R.: Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?. SIAM J. Comput.\u00a037(1), 319\u2013357 (2007)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"31_CR14","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":"31_CR15","unstructured":"Kumar, A., Manokaran, R., Tulsiani, M., Vishnoi, N.K.: On the optimality of a class of LP-based algorithms (2009) (manuscript)"},{"key":"31_CR16","first-page":"209","volume":"26","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On minimax theorems of combinatorics. Doctoral Thesis, Mathematiki Lapok\u00a026, 209\u2013264 (1975)","journal-title":"Doctoral Thesis, Mathematiki Lapok"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Manokaran, R., Naor, J., Raghavendra, P., Schwartz, R.: SDP gaps and UGC hardness for multiway cut, 0-extension, and metric labeling. In: Proc. 40\n                    th\n                   ACM STOC, pp. 11\u201320 (2008)","DOI":"10.1145\/1374376.1374379"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Mossel, E.: Gaussian bounds for noise correlation of functions and tight analysis of long codes. In: Proc. 49\n                    th\n                   IEEE FOCS, pp. 156\u2013165 (2008)","DOI":"10.1109\/FOCS.2008.44"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Raghavendra, P.: Optimal algorithms and inapproximability results for every CSP? In: Proc. 40\n                    th\n                   ACM STOC, pp. 245\u2013254 (2008)","DOI":"10.1145\/1374376.1374414"},{"issue":"1","key":"31_CR20","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/070681612","volume":"39","author":"A. Samorodnitsky","year":"2009","unstructured":"Samorodnitsky, A., Trevisan, L.: Gowers uniformity, influence of variables, and PCPs. SIAM J. Comput.\u00a039(1), 323\u2013360 (2009)","journal-title":"SIAM J. Comput."},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proc. 33\n                    rd\n                   ACM STOC, pp. 453\u2013461 (2001)","DOI":"10.1145\/380752.380839"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:40:51Z","timestamp":1558280451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}