{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T17:21:59Z","timestamp":1775150519598,"version":"3.50.1"},"reference-count":22,"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":36,"title":["Proving integrality gaps without knowing the linear program"],"prefix":"10.1109","author":[{"given":"S.","family":"Arora","sequence":"first","affiliation":[]},{"given":"B.","family":"Bollobas","sequence":"additional","affiliation":[]},{"given":"L.","family":"Lovasz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Cut problems and their application to divide-and-conquer","author":"shmoys","year":"0","journal-title":"Approximation Algorithms for NP-Hard Problems"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90024-Y"},{"key":"17","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":"18","first-page":"354","article-title":"Lower bounds on the monotone complexity of some boolean functions","volume":"31","author":"razborov","year":"1985","journal-title":"Soviet Math Dokl"},{"key":"15","article-title":"Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems","author":"hochbaum","year":"0","journal-title":"Approximation Algorithms for NP-Hard Problems"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0008-z"},{"key":"13","year":"1996","journal-title":"Approximation Algorithms for NP-Hard Problems"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1137\/0801013"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1287\/moor.26.4.796.10012"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120913"},{"key":"3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume":"184","author":"bolloba?s","year":"1998","journal-title":"Modern Graph Theory Graduate Texts in Mathematics"},{"key":"20","author":"vazirani","year":"2001","journal-title":"Approximation Algorithms"},{"key":"2","article-title":"Hardness of approximations","author":"arora","year":"0","journal-title":"Approximation Algorithms for NP-Hard Problems"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585563"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1959-003-9"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509915"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90167-2"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.2307\/2275569"},{"key":"9","article-title":"The probable value of the Lova?sz-Schrijver relaxations for maximum independent set","author":"feige","year":"2002"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300003260"}],"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":[[2017,6,15]],"date-time":"2017-06-15T18:46:25Z","timestamp":1497552385000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181954\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1181954","relation":{},"subject":[]}}