{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:45:46Z","timestamp":1772552746875,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0196-6774(02)00005-6","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T13:02:46Z","timestamp":1034341366000},"page":"201-219","source":"Crossref","is-referenced-by-count":29,"title":["Improved approximation of Max-Cut on graphs of bounded degree"],"prefix":"10.1016","volume":"43","author":[{"given":"Uriel","family":"Feige","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0196-6774(02)00005-6_BIB001","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0196-6774(02)00005-6_BIB002","doi-asserted-by":"crossref","unstructured":"P. Berman, M. Karpinski, On some tighter inapproximability results, further improvements, ECCC, TR98-065, 1998. Extended abstract appears in ICALP 1999, pp. 200\u2013209","DOI":"10.1007\/3-540-48523-6_17"},{"key":"10.1016\/S0196-6774(02)00005-6_BIB003","series-title":"Advances in Computing Science","first-page":"27","article-title":"Approximation algorithm for the Max Cut problem on cubic graphs","author":"Calamoneri","year":"1999"},{"key":"10.1016\/S0196-6774(02)00005-6_BIB004","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1137\/S0097539793245350","article-title":"Local search for Max-Cut","volume":"24","author":"Poljak","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(02)00005-6_BIB005","series-title":"Proc. 3rd Israel Symposium on Theory of Computing and Systems","first-page":"182","article-title":"Approximating the value of two prover proof systems with applications to Max-2-Sat and Max-Dicut","author":"Feige","year":"1995"},{"key":"10.1016\/S0196-6774(02)00005-6_BIB006","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","article-title":"On the cut polytope","volume":"36","author":"Barahona","year":"1986","journal-title":"Math. Program."},{"key":"10.1016\/S0196-6774(02)00005-6_BIB007","series-title":"Proc. 33rd Annual ACM Symposium on the Theory of Computing","first-page":"433","article-title":"On the optimality of the random hyperplane rounding technique for MAX CUT","author":"Feige","year":"2001"},{"key":"10.1016\/S0196-6774(02)00005-6_BIB008","series-title":"Proc. 31th ACM Symposium on Theory of Computing","first-page":"679","article-title":"Outward rotations: a new tool for rounding solutions of semidefinite programming relaxations, with application to Max-Cut and other problems","author":"Zwick","year":"1999"},{"key":"10.1016\/S0196-6774(02)00005-6_BIB009","series-title":"Proc. 28th Annual ACM Symposium on Theory of Computing","first-page":"427","article-title":"How good is the Goemans\u2013Williamson MAX CUT algorithm?","author":"Karloff","year":"1996"},{"key":"10.1016\/S0196-6774(02)00005-6_BIB010","series-title":"Proc. 38th Annual IEEE Symposium on Foundations of Computer Science","first-page":"406","article-title":"A 7\/8-approximation algorithm for Max-3-Sat?","author":"Karloff","year":"1997"},{"key":"10.1016\/S0196-6774(02)00005-6_BIB011","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1080\/10556789808805690","article-title":"Semidefinite relaxation and nonconvex quadratic optimization","volume":"9","author":"Nesterov","year":"1998","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/S0196-6774(02)00005-6_BIB012","series-title":"Probability Theory","author":"Renyi","year":"1970"},{"key":"10.1016\/S0196-6774(02)00005-6_BIB013","series-title":"Proc. of 13th SODA","first-page":"506","article-title":"Max-Cut in cubic graphs","author":"Halperin","year":"2002"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677402000056?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677402000056?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T05:55:16Z","timestamp":1554962116000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677402000056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0196677402000056"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(02)00005-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}