{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T10:23:35Z","timestamp":1780395815828,"version":"3.54.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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,3]]},"DOI":"10.1016\/s0020-0190(98)00021-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"305-311","source":"Crossref","is-referenced-by-count":31,"title":["Better approximation algorithms for Set Splitting and Not-All-Equal Sat"],"prefix":"10.1016","volume":"65","author":[{"given":"Gunnar","family":"Andersson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lars","family":"Engebretsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00021-0_BIB1","series-title":"Proc. 21st Internat. Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"167","article-title":"Non-oblivious local search for graph and hypergraph coloring problems","volume":"vol. 1017","author":"Alimonti","year":"1995"},{"key":"10.1016\/S0020-0190(98)00021-0_BIB2","series-title":"Electronic Colloquium of Computational Complexity","article-title":"Max NP-completeness made easy","author":"Crescenzi","year":"1997"},{"key":"10.1016\/S0020-0190(98)00021-0_BIB3","series-title":"Proc. 3rd Israel Symp. on Theory of Computing and Systems","first-page":"182","article-title":"Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT","author":"Feige","year":"1995"},{"key":"10.1016\/S0020-0190(98)00021-0_BIB4","series-title":"Proc. 26th Ann. ACM Symp. on Theory of Computing","first-page":"422","article-title":"878-approximation algorithms for MAX CUT and MAX 2SAT","author":"Goemans","year":"1994"},{"issue":"4","key":"10.1016\/S0020-0190(98)00021-0_BIB5","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1137\/S0895480192243516","article-title":"New 34-approximation algorithms for the maximum satisfiability problem","volume":"7","author":"Goemans","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(98)00021-0_BIB6","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(98)00021-0_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)00021-0_BIB8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(98)00021-0_BIB9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0020-0190(96)00046-4","article-title":"Approximability of maximum splitting of k-sets and some other Apx-complete problems","volume":"58","author":"Kann","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00021-0_BIB10","series-title":"Proc. 4th Southeastern Conf. on Combinatorics, Graph Theory, and Computing","first-page":"3","article-title":"Coverings and colorings of hypergraphs","author":"Lov\u00e1sz","year":"1973"},{"key":"10.1016\/S0020-0190(98)00021-0_BIB11","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)00021-0_BIB12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01202286","article-title":"The hardness of approximation: Gap location","volume":"4","author":"Petrank","year":"1994","journal-title":"Computational Complexity"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000210?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000210?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:21:31Z","timestamp":1556158891000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0020019098000210"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00021-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}