{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T04:39:05Z","timestamp":1773808745614,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":7868,"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":[[1992,1]]},"DOI":"10.1016\/0890-5401(92)90056-l","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"77-94","source":"Crossref","is-referenced-by-count":92,"title":["On the complexity of approximating the independent set problem"],"prefix":"10.1016","volume":"96","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Schnitger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(92)90056-L_BIB1","series-title":"Proc. 4th Intl. Coll. on Automata, Languages and Programming","first-page":"45","article-title":"On the structure of combinatorial problems and structure preserving reductions","author":"Ausiello","year":"1977"},{"key":"10.1016\/0890-5401(92)90056-L_BIB2","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(92)90056-L_BIB3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(80)90006-7","article-title":"Towards a unified approach for the classification of NP-complete optimization problems","volume":"12","author":"Ausiello","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(92)90056-L_BIB4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. of Math. Statist."},{"key":"10.1016\/0890-5401(92)90056-L_BIB5","author":"Erdoes","year":"1974"},{"key":"10.1016\/0890-5401(92)90056-L_BIB6","volume":"Vol. 1","author":"Feller","year":"1968"},{"key":"10.1016\/0890-5401(92)90056-L_BIB7","author":"Garey","year":"1979"},{"key":"10.1016\/0890-5401(92)90056-L_BIB8","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(92)90056-L_BIB9","series-title":"Proc. 18th Annual ACM Symp. on Theory of Computing","first-page":"69","article-title":"The complexity of optimization problems","author":"Krentel","year":"1986"},{"key":"10.1016\/0890-5401(92)90056-L_BIB10","series-title":"Proc. 29th Annual Symp. on Foundations of Computer Science","first-page":"422","article-title":"An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximate algorithms","author":"Leighton","year":"1988"},{"key":"10.1016\/0890-5401(92)90056-L_BIB11","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","article-title":"The complexity of some problems on subsequences and supersequences","volume":"25","author":"Maier","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(92)90056-L_BIB12","first-page":"183","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0890-5401(92)90056-L_BIB13","first-page":"224","author":"Niven","year":"1980"},{"key":"10.1016\/0890-5401(92)90056-L_BIB14","author":"Orponen","year":"1987"},{"key":"10.1016\/0890-5401(92)90056-L_BIB15","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."},{"key":"10.1016\/0890-5401(92)90056-L_BIB16","series-title":"Proc. 20th Annual ACM Symp. on Theory of Computing","first-page":"229","article-title":"Optimization, approximation and complexity classes","author":"Papadimitriou","year":"1988"},{"key":"10.1016\/0890-5401(92)90056-L_BIB17","first-page":"212","author":"Roberts","year":"1984"},{"key":"10.1016\/0890-5401(92)90056-L_BIB18","author":"Simon","year":"1988"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019290056L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019290056L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:25:31Z","timestamp":1548879931000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019290056L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["089054019290056L"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(92)90056-l","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}