{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:03:03Z","timestamp":1730196183595,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1109\/allerton.2009.5394484","type":"proceedings-article","created":{"date-parts":[[2010,1,26]],"date-time":"2010-01-26T12:35:50Z","timestamp":1264509350000},"page":"1590-1596","source":"Crossref","is-referenced-by-count":6,"title":["Graph covers and quadratic minimization"],"prefix":"10.1109","author":[{"given":"Nicholas","family":"Ruozzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Thaler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sekhar","family":"Tatikonda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Convergence of the min-sum message passing algorithm for quadratic optimization","year":"2008","author":"moallemi","key":"ref4"},{"key":"ref3","first-page":"2031","article-title":"Walk-sums and belief propagation in gaussian graphical models","volume":"7","author":"malioutov","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1023\/B:STCO.0000021412.33763.d5"},{"key":"ref5","article-title":"Convergence of the min-sum algorithm for convex optimization","author":"moallemi","year":"2007","journal-title":"Forty-Fifth Annual Allerton Conference on Communication Control and Computing"},{"article-title":"Message-passing for maximum weight independent set","year":"2008","author":"sanghavi","key":"ref8"},{"key":"ref7","first-page":"467","article-title":"Loopy belief propagation for approximate inference: An empirical study","author":"murphy","year":"1999","journal-title":"Uncertainty in Artificial Intelligence"},{"key":"ref2","article-title":"Graph-cover decoding and finite-length analysis of message-passing iterative decoding of ldpc codes","volume":"512078","author":"vontobel","year":"2005","journal-title":"CoRR"},{"article-title":"Tightness of lp via max-product belief propagation","year":"2005","author":"sanghavi","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/800141.804655"}],"event":{"name":"2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2009,9,30]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2009,10,2]]}},"container-title":["2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5375733\/5394483\/05394484.pdf?arnumber=5394484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T17:25:31Z","timestamp":1489857931000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5394484\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/allerton.2009.5394484","relation":{},"subject":[],"published":{"date-parts":[[2009,9]]}}}