{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T15:43:38Z","timestamp":1776181418136,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"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":[[1995,4]]},"DOI":"10.1016\/0020-0190(95)00006-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:04:31Z","timestamp":1027634671000},"page":"73-79","source":"Crossref","is-referenced-by-count":27,"title":["Local search, reducibility and approximability of NP-optimization problems"],"prefix":"10.1016","volume":"54","author":[{"given":"Giorgio","family":"Ausiello","sequence":"first","affiliation":[]},{"given":"Marco","family":"Protasi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00006-X_BIB1","series-title":"Proc. 2nd Italian Conf. on Algorithms and Complexity","first-page":"40","article-title":"New local search approximation techniques for maximum generalized satisfiability problems","volume":"778","author":"Alimonti","year":"1994"},{"key":"10.1016\/0020-0190(95)00006-X_BIB2","series-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science","first-page":"14","article-title":"Proof verification and hardness of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/0020-0190(95)00006-X_BIB3","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(94)00291-P","article-title":"Approximate solution of NP optimization problems","author":"Ausiello","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(95)00006-X_BIB4","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":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(95)00006-X_BIB5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(80)90006-7","article-title":"Toward a unified approach for the classification of NP-complete problems","volume":"12","author":"Ausiello","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(95)00006-X_BIB6","first-page":"1","article-title":"A structural overview of NP optimization problems","volume":"2","author":"Bruschi","year":"1991","journal-title":"Algorithms Review"},{"key":"10.1016\/0020-0190(95)00006-X_BIB7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0890-5401(91)90025-W","article-title":"Completeness in approximation classes","volume":"93","author":"Crescenzi","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(95)00006-X_BIB8","series-title":"Proc. 14th Conf. on Foundations of Software Technology and Theoretical Computer Science","first-page":"330","article-title":"On approximation scheme preserving reducibility and its applications","volume":"880","author":"Crescenzi","year":"1994"},{"key":"10.1016\/0020-0190(95)00006-X_BIB9","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(95)00006-X_BIB10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","article-title":"How easy is local search?","volume":"37","author":"Johnson","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(95)00006-X_BIB11","article-title":"On the approximability of NP-complete optimization problems","author":"Kann","year":"1992"},{"key":"10.1016\/0020-0190(95)00006-X_BIB12","series-title":"Proc. 35rd IEEE Symp. on Foundations of Computer Science","first-page":"819","article-title":"On syntactic versus computational views of approximability","author":"Khanna","year":"1994"},{"key":"10.1016\/0020-0190(95)00006-X_BIB13","series-title":"Nonlinear Programming","first-page":"415","article-title":"On the existence of fast approximation schemes","author":"Korte","year":"1981"},{"key":"10.1016\/0020-0190(95)00006-X_BIB14","series-title":"The Traveling Salesman Problem","author":"Lawler","year":"1985"},{"key":"10.1016\/0020-0190(95)00006-X_BIB15_1","series-title":"Proc. 20th ACM Symp. on Theory of Comput.","first-page":"229","article-title":"Optimization, approximation and complexity classes","author":"Papadimitriou","year":"1988"},{"key":"10.1016\/0020-0190(95)00006-X_BIB15_2","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(95)00006-X_BIB16","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(81)90081-5","article-title":"Non deterministic polynomial optimization problems and their approximation","volume":"15","author":"Paz","year":"1981","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500006X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500006X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T22:58:36Z","timestamp":1555282716000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500006X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["002001909500006X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00006-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}