{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T12:21:25Z","timestamp":1648556485826},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":[[1998,2]]},"DOI":"10.1016\/s0020-0190(98)00005-2","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"145-150","source":"Crossref","is-referenced-by-count":0,"title":["Approximate Max k-Cut with subgraph guarantee"],"prefix":"10.1016","volume":"65","author":[{"given":"Viggo","family":"Kann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Lagergren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Panconesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00005-2_BIB1","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1016\/S0020-0190(98)00005-2_BIB2","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9967-7","article-title":"Graph Theory: An Introductory Course","author":"Bollob\u00e1s","year":"1979"},{"key":"10.1016\/S0020-0190(98)00005-2_BIB3","series-title":"Proc. 4th Internat. Conf. on Integer Programming and Combinatorial Optimization","first-page":"1","article-title":"Improved approximation algorithms for Max k-Cut and Max Bisection","volume":"vol. 920","author":"Frieze","year":"1995"},{"key":"10.1016\/S0020-0190(98)00005-2_BIB4","series-title":"Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"434","article-title":"Data structures for weighted matching and nearest common ancestors with linking","author":"Gabow","year":"1990"},{"key":"10.1016\/S0020-0190(98)00005-2_BIB5","series-title":"Tech. Rept. TRECIS-8501","article-title":"Algorithms for edge coloring graphs","author":"Gabow","year":"1985"},{"key":"10.1016\/S0020-0190(98)00005-2_BIB6","series-title":"Concrete Mathematics","author":"Graham","year":"1989"},{"key":"10.1016\/S0020-0190(98)00005-2_BIB7","series-title":"Proc. 29th Ann. ACM Symp. on Theory of Computing","first-page":"1","article-title":"Some optimal inapproximability results","author":"H\u00e5stad","year":"1997"},{"key":"10.1016\/S0020-0190(98)00005-2_BIB8","article-title":"On the hardness of approximating Max k-Cut and its dual","volume":"2","author":"Kann","year":"1997","journal-title":"Chicago J. Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(98)00005-2_BIB9","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0020-0190(98)00005-2_BIB10","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(98)00005-2_BIB11","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","article-title":"A short proof of the factor theorem for finite graphs","volume":"6","author":"Tutte","year":"1954","journal-title":"Canad. J. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000052?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000052?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T14:53:44Z","timestamp":1555944824000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0020019098000052"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00005-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}