{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:45:27Z","timestamp":1772552727907,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s0020-0190(00)00189-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:19:59Z","timestamp":1027617599000},"page":"181-188","source":"Crossref","is-referenced-by-count":18,"title":["A note on approximating Max-Bisection on regular graphs"],"prefix":"10.1016","volume":"79","author":[{"given":"Uriel","family":"Feige","sequence":"first","affiliation":[]},{"given":"Marek","family":"Karpinski","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00189-7_BIB001","series-title":"ECCC, TR98-065","article-title":"On some tighter inapproximability results, further improvements","author":"Berman","year":"1998"},{"key":"10.1016\/S0020-0190(00)00189-7_BIB002","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0095-8956(86)90029-8","article-title":"The number of matchings in random graphs and bipartite graphs","volume":"41","author":"Bollob\u00e1s","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0020-0190(00)00189-7_BIB003","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02523688","article-title":"Improved approximation algorithms for Max-k-Cut and Max-Bisection","volume":"18","author":"Frieze","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(00)00189-7_BIB004","series-title":"ECCC, TR00-021","article-title":"Improved approximation of Max-Cut on graphs of bounded degree","author":"Feige","year":"2000"},{"key":"10.1016\/S0020-0190(00)00189-7_BIB005","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\/S0020-0190(00)00189-7_BIB006","series-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing","first-page":"1","article-title":"Some optimal inapproximability results","author":"H\u00e5stad","year":"1997"},{"key":"10.1016\/S0020-0190(00)00189-7_BIB007","series-title":"Improved approximation algorithms for maximum graph bisection problems","author":"Halperin","year":"2000"},{"issue":"301","key":"10.1016\/S0020-0190(00)00189-7_BIB008","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2282952","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"Amer. Statist. Assoc. J."},{"key":"10.1016\/S0020-0190(00)00189-7_BIB009","unstructured":"Y. Ye, A 0.699-approximation algorithm for Max-Bisection, submitted to Math. Programming; Available at URL"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001897?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001897?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T02:22:16Z","timestamp":1556158936000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000001897"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0020019000001897"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00189-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}