{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:05Z","timestamp":1725558785024},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405436"},{"type":"electronic","value":"9783540450771"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45077-1_1","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T16:53:34Z","timestamp":1277484814000},"page":"1-1","source":"Crossref","is-referenced-by-count":2,"title":["Proving Integrality Gaps without Knowing the Linear Program"],"prefix":"10.1007","author":[{"given":"Sanjeev","family":"Arora","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Bollob\u00e1s, B., Lov\u00e1sz, L.: Proving integrality gaps without knowing the linear program. In: Proc. IEEE FOCS 2002 (2002)","DOI":"10.1007\/978-3-540-45077-1_1"},{"key":"1_CR2","unstructured":"Arora, S., Lund, C.: Hardness of approximations. In: [3]"},{"volume-title":"Approximation Algorithms for NP-hard problems","year":"1996","key":"1_CR3","unstructured":"Hochbaum, D. (ed.): Approximation Algorithms for NP-hard problems. PWS Publishing, Boston (1996)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1990","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and setfunctions, and 0-1 optimization. SIAM Journal on Optimization\u00a01, 166\u2013190 (1990)","journal-title":"SIAM Journal on Optimization"},{"key":"1_CR5","first-page":"411","volume":"3","author":"H.D. Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zeroone programming problems. SIAM J. Optimization\u00a03, 411\u2013430 (1990)","journal-title":"SIAM J. Optimization"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45077-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T08:53:18Z","timestamp":1559206398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45077-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405436","9783540450771"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45077-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}