{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:17:35Z","timestamp":1758269855258,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1109\/isit.2009.5205779","type":"proceedings-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T11:09:52Z","timestamp":1251112192000},"page":"2808-2812","source":"Crossref","is-referenced-by-count":1,"title":["An SDP primal-dual algorithm for approximating the Lovász-theta function"],"prefix":"10.1109","author":[{"given":"T-H. Hubert","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin L.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajiv","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185411"},{"key":"18","first-page":"69","article-title":"how the proof of the strong perfect graph conjecture was found","volume":"109","author":"seymour","year":"2006","journal-title":"Gazette des Mathematiciens"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055985"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/CACSD.1996.555289"},{"key":"13","doi-asserted-by":"crossref","DOI":"10.37236\/1193","article-title":"the sandwich theorem","volume":"1","author":"knuth","year":"1994","journal-title":"Electronic Journal of Combinatorics"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.62"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237980"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/274787.274791"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250823"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030890"},{"year":"0","key":"2"},{"journal-title":"The multiplicative weights update method A meta-algorithm and applications","year":"0","author":"arora","key":"1"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1137\/090762671"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743463"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2006.164.51"},{"year":"0","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/0805002"},{"year":"0","key":"9"},{"journal-title":"Geometric Algorithms and Combinatorial Optimization","year":"1987","author":"grotchel","key":"8"}],"event":{"name":"2009 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2009,6,28]]},"location":"Seoul, South Korea","end":{"date-parts":[[2009,7,3]]}},"container-title":["2009 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5179947\/5205248\/05205779.pdf?arnumber=5205779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T14:05:00Z","timestamp":1590069900000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5205779\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit.2009.5205779","relation":{},"subject":[],"published":{"date-parts":[[2009,6]]}}}