{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T07:21:27Z","timestamp":1780471287306,"version":"3.54.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1974,12,1]],"date-time":"1974-12-01T00:00:00Z","timestamp":155088000000},"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":14108,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1974,12]]},"DOI":"10.1016\/s0022-0000(74)80044-9","type":"journal-article","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T17:06:12Z","timestamp":1272992772000},"page":"256-278","source":"Crossref","is-referenced-by-count":1468,"title":["Approximation algorithms for combinatorial problems"],"prefix":"10.1016","volume":"9","author":[{"given":"David S.","family":"Johnson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(74)80044-9_bib1","series-title":"Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0022-0000(74)80044-9_bib2","series-title":"Proceedings of the 4th Annual ACM Symposium on the Theory of Computing","first-page":"143","article-title":"Worst-Case analysis of memory allocation algorithms","author":"Garey","year":"1972"},{"key":"10.1016\/S0022-0000(74)80044-9_bib3","series-title":"Proceedings of the Spring Joint Computer Conference","first-page":"205","article-title":"Bounds on multiprocessing anomalies and related packing algorithms","author":"Graham","year":"1972"},{"key":"10.1016\/S0022-0000(74)80044-9_bib4","series-title":"Proceedings of the 13th Annual IEEE Symposium on Switching and Automata Theory","first-page":"144","article-title":"Fast allocation algorithms","author":"Johnson","year":"1972"},{"key":"10.1016\/S0022-0000(74)80044-9_bib5","article-title":"Near-optimal bin packing algorithms","author":"Johnson","year":"1973"},{"key":"10.1016\/S0022-0000(74)80044-9_bib6","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0022-0000(74)80044-9_bib7","series-title":"Graph Theory and Computing","first-page":"109","article-title":"Graph coloring algorithms","author":"Matula","year":"1972"},{"key":"10.1016\/S0022-0000(74)80044-9_bib8","article-title":"On the knapsack and other computationally related problems","author":"Sahni","year":"1973"},{"key":"10.1016\/S0022-0000(74)80044-9_bib9","unstructured":"J. H. Spencer, private communication."},{"key":"10.1016\/S0022-0000(74)80044-9_bib10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","article-title":"An upper bound to the chromatic number of a graph and its application to time-tabling problems","volume":"10","author":"Welsh","year":"1967","journal-title":"Comput. J."},{"key":"10.1016\/S0022-0000(74)80044-9_bib11","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1093\/comjnl\/12.4.317","article-title":"A technique for coloring a graph applicable to large scale time-tabling problems","volume":"12","author":"Wood","year":"1969","journal-title":"Comput. J."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800449?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000074800449?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,11]],"date-time":"2018-12-11T05:58:11Z","timestamp":1544507891000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000074800449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,12]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1974,12]]}},"alternative-id":["S0022000074800449"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(74)80044-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1974,12]]}}}