{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:51:33Z","timestamp":1778295093944,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8021,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,8]]},"DOI":"10.1016\/0890-5401(91)90025-w","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"241-262","source":"Crossref","is-referenced-by-count":61,"title":["Completeness in approximation classes"],"prefix":"10.1016","volume":"93","author":[{"given":"Pierluigi","family":"Crescenzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Panconesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90025-W_BIB1","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\/0890-5401(91)90025-W_BIB2","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\/0890-5401(91)90025-W_BIB3","author":"Bruschi","year":"1989"},{"key":"10.1016\/0890-5401(91)90025-W_BIB4","series-title":"Proceedings, 3rd ACM Symposium on Theory of Computation","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0890-5401(91)90025-W_BIB5","author":"Garey","year":"1979"},{"key":"10.1016\/0890-5401(91)90025-W_BIB6","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0304-3975(86)90144-1","article-title":"On simple and creative sets in NP","volume":"47","author":"Homer","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90025-W_BIB7","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","article-title":"Using dual approximation algorithms for scheduling problems: Theoretical and practical results","volume":"34","author":"Hochbaum","year":"1987","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90025-W_BIB8","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation for the knapsack and sum of subset problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90025-W_BIB9","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\/0890-5401(91)90025-W_BIB10","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","article-title":"The complexity of optimization problems","volume":"36","author":"Krentel","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90025-W_BIB11","series-title":"Nonlinear Programming 4","article-title":"On the existence of fast approximation schemes","author":"Korte","year":"1981"},{"key":"10.1016\/0890-5401(91)90025-W_BIB12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90025-W_BIB13","author":"Orponen","year":"1987"},{"key":"10.1016\/0890-5401(91)90025-W_BIB14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(81)90081-5","article-title":"NP-optimization problems and their approximation","volume":"15","author":"Paz","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90025-W_BIB15","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0890-5401(91)90025-W_BIB16","series-title":"Proceedings, 20th ACM Symposium, Theory of Computation","first-page":"229","article-title":"Optimization, approximation, and complexity classes","author":"Papadimitriou","year":"1988"},{"key":"10.1016\/0890-5401(91)90025-W_BIB17","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","article-title":"Algorithms for scheduling independent tasks","volume":"23","author":"Sahni","year":"1976","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190025W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190025W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:25:38Z","timestamp":1548897938000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190025W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["089054019190025W"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90025-w","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}