{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T04:32:30Z","timestamp":1754195550368},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0377-2217(02)00299-0","type":"journal-article","created":{"date-parts":[[2003,2,17]],"date-time":"2003-02-17T13:07:53Z","timestamp":1045487273000},"page":"397-404","source":"Crossref","is-referenced-by-count":15,"title":["Differential approximation for optimal satisfiability and related problems"],"prefix":"10.1016","volume":"147","author":[{"given":"Cristina","family":"Bazgan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0377-2217(02)00299-0_BIB1","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","article-title":"Proof verification and intractability of approximation problems","volume":"45","author":"Arora","year":"1998","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S0377-2217(02)00299-0_BIB2","series-title":"Complexity and approximation. Combinatorial optimization problems and their approximability properties","author":"Ausiello","year":"1999"},{"key":"10.1016\/S0377-2217(02)00299-0_BIB3","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/0022-0000(80)90046-X","article-title":"Structure preserving reductions among convex optimization problems","volume":"21","author":"Ausiello","year":"1980","journal-title":"Journal of Computing and System Sciences"},{"key":"10.1016\/S0377-2217(02)00299-0_BIB4","series-title":"Handbook of Combinatorial Optimization","article-title":"Algorithms and heuristics for max-sat","author":"Battiti","year":"1998"},{"key":"10.1016\/S0377-2217(02)00299-0_BIB5","unstructured":"P. Crescenzi, V. Kann. A compendium of NP optimization problems. Available on www_address: http:\/\/www.nada.kth.se\/viggo\/problemlist\/compendium.html"},{"key":"10.1016\/S0377-2217(02)00299-0_BIB6","series-title":"Proceedings of the 4th Israeli Symposium on Theory of Computing and Systems","first-page":"68","article-title":"To weight or not to weight: where is the question?","author":"Crescenzi","year":"1996"},{"key":"10.1016\/S0377-2217(02)00299-0_BIB7","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(95)00060-7","article-title":"On an approximation measure founded on the links between optimization and polynomial approximation theory","volume":"158","author":"Demange","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S0377-2217(02)00299-0_BIB8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","article-title":"Clique is hard to approximate within n1\u2212\u03f5","volume":"182","author":"H\u00e5stad","year":"1999","journal-title":"Acta Mathematica"},{"issue":"1","key":"10.1016\/S0377-2217(02)00299-0_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(88)90044-2","article-title":"Resolution vs. cutting plane solution of inference problems: some computational experience","volume":"7","author":"Hooker","year":"1988","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00299-0_BIB10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02283686","article-title":"Computational experience with an interior point algorithm on the satisfiability problem","volume":"25","author":"Kamath","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00299-0_BIB11","unstructured":"V. Kann, On the approximability of NP-complete optimization problems, PhD thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, Sweden, 1992"},{"key":"10.1016\/S0377-2217(02)00299-0_BIB12","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":"Journal of Computing and System Sciences"},{"key":"10.1016\/S0377-2217(02)00299-0_BIB13","series-title":"Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"201","article-title":"Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint","author":"Zwick","year":"1998"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002990?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702002990?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T12:57:44Z","timestamp":1555160264000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702002990"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0377221702002990"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00299-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}