{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T01:10:48Z","timestamp":1772068248493,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,9,1]],"date-time":"1980-09-01T00:00:00Z","timestamp":336614400000},"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":12007,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1980,9]]},"DOI":"10.1016\/0304-3975(80)90006-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"83-96","source":"Crossref","is-referenced-by-count":33,"title":["Toward a unified approach for the classification of NP-complete optimization problems"],"prefix":"10.1016","volume":"12","author":[{"given":"G.","family":"Ausiello","sequence":"first","affiliation":[]},{"given":"A.","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[]},{"given":"M.","family":"Protasi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90006-7_BIB1","author":"Ausiello","year":"1977","journal-title":"On the structure of combinatorial problems and structure preserving reductions"},{"key":"10.1016\/0304-3975(80)90006-7_BIB2","unstructured":"G. Ausiello, A. D'Atri and M. Protasi, Lattice theoretic ordering properties for NP-complete optimization problems, Fund. Informat., to appear."},{"key":"10.1016\/0304-3975(80)90006-7_BIB3","series-title":"Algorithms and Complexity: New Directions and Recent Results","article-title":"Approximation algorithms for combinatorial problems: an annotated bibliography","author":"Garey","year":"1976"},{"issue":"3","key":"10.1016\/0304-3975(80)90006-7_BIB4","doi-asserted-by":"crossref","DOI":"10.1145\/322077.322090","article-title":"\u201cStrong\u201d NP-completeness results: motivation, examples and implications","volume":"25","author":"Garey","year":"1978","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0304-3975(80)90006-7_BIB5","doi-asserted-by":"crossref","DOI":"10.2307\/2270580","article-title":"Limiting recursion","volume":"30","author":"Gold","year":"1965","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(80)90006-7_BIB6","article-title":"On isomorphism and density of NP and other complete sets","author":"Hartmanis","year":"1976","journal-title":"Proc. 8th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(80)90006-7_BIB7","article-title":"Approximation algorithms for combinatorial problems","author":"Johnson","year":"1973","journal-title":"Proc. 5th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(80)90006-7_BIB8","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"1","key":"10.1016\/0304-3975(80)90006-7_BIB9","doi-asserted-by":"crossref","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocation and sequencing problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Management Sci."},{"key":"10.1016\/0304-3975(80)90006-7_BIB10","article-title":"Efficiently approximable problems: characterizations and examples","volume":"135","author":"Moran","year":"1978"},{"key":"10.1016\/0304-3975(80)90006-7_BIB11","author":"Paz","year":"1977","journal-title":"NP-optimization problems and their approximation"},{"issue":"1","key":"10.1016\/0304-3975(80)90006-7_BIB12","doi-asserted-by":"crossref","DOI":"10.1145\/321921.321934","article-title":"Algorithms for scheduling independents tasks","volume":"3","author":"Sahni","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(80)90006-7_BIB13","article-title":"A new evaluation function for approximation algorithms","author":"Ventriglia","year":"1977","journal-title":"Proc. Informatica 77"},{"key":"10.1016\/0304-3975(80)90006-7_BIB14","series-title":"Technical Report No. 323","article-title":"Functions for measuring the quality of approximate solutions to zero-one programming problems","author":"Zemel","year":"1978"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900067?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900067?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T11:31:39Z","timestamp":1580902299000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397580900067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,9]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,9]]}},"alternative-id":["0304397580900067"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90006-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,9]]}}}