{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T05:35:48Z","timestamp":1792906548198,"version":"4.5.0"},"reference-count":21,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1181954","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T11:35:00Z","timestamp":1056627300000},"page":"313-322","source":"Crossref","is-referenced-by-count":37,"title":["Proving integrality gaps without knowing the linear program"],"prefix":"10.1109","author":[{"given":"S.","family":"Arora","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B.","family":"Bollobas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L.","family":"Lovasz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60615-7_5"},{"key":"ref3","first-page":"xiv+394","volume-title":"Modern Graph Theory, Graduate Texts in Mathematics","volume":"184","author":"Bollob\u00e1s","year":"1998"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2307\/2275569"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90167-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509915"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1959-003-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300003260"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/s009753970240118x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585563"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/moor.26.4.796.10012"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4"},{"key":"ref13","volume-title":"Approximation Algorithms for NP-hard problems","author":"Hochbaum","year":"1996"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0801013"},{"key":"ref15","article-title":"Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems","author":"Hochbaum","journal-title":"[13]"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335320"},{"issue":"4","key":"ref17","first-page":"798","article-title":"Lower bounds on the monotone complexity of some boolean functions","volume":"281","author":"Razborov","year":"1985","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"ref18","article-title":"Cut problems and their application to divide-and-conquer","author":"Shmoys","journal-title":"[13]"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/springerreference_57547"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0120913"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90024-Y"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","location":"Vancouver, BC, Canada","acronym":"SFCS-02"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01181954.pdf?arnumber=1181954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,25]],"date-time":"2026-10-25T04:59:04Z","timestamp":1792904344000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181954\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1181954","relation":{},"subject":[]}}