{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T10:12:16Z","timestamp":1758190336008,"version":"3.44.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1998,6,19]],"date-time":"1998-06-19T00:00:00Z","timestamp":898214400000},"content-version":"vor","delay-in-days":138,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0020-0190(97)00219-6","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"151-156","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP"],"prefix":"10.1016","volume":"65","author":[{"given":"Edith","family":"Hemaspaandra","sequence":"first","affiliation":[]},{"given":"J\u00f6rg","family":"Rothe","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00219-6_BIB1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0020-0190(96)00208-6","article-title":"It is hard to know when greedy is good for finding independent sets","volume":"61","author":"Bodlaender","year":"1997","journal-title":"Inform. Process. Lett."},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/S0020-0190(97)00219-6_BIB2"},{"key":"10.1016\/S0020-0190(97)00219-6_BIB3","series-title":"Proc. 26th ACM Symp. on Theory of Computing","first-page":"439","article-title":"Greed is good: Approximating independent sets in sparse and bounded-degree graphs","author":"Halldorsson","year":"1994"},{"key":"10.1016\/S0020-0190(97)00219-6_BIB4","series-title":"Tech. Rept. Math\/Inf\/97\/14","article-title":"Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP","author":"Hemaspaandra","year":"1997"},{"key":"10.1016\/S0020-0190(97)00219-6_BIB5_1","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1137\/0217080","article-title":"The polynomial time hierarchy collapses if the boolean hierarchy collapses","volume":"17","author":"Kadin","year":"1988","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0020-0190(97)00219-6_BIB5_2","first-page":"404","volume":"20","author":"Kadin","year":"1988","journal-title":"Erratum: SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00219-6_BIB6","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1051\/ita\/1987210404191","article-title":"The difference and truth-table hierarchies for NP","volume":"21","author":"K\u00f6bler","year":"1987","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/S0020-0190(97)00219-6_BIB7","series-title":"Proc. 13th IEEE Symp. on Switching and Automata Theory","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972"},{"key":"10.1016\/S0020-0190(97)00219-6_BIB8","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","article-title":"The complexity of facets (and some facets of complexity)","volume":"28","author":"Papadimitriou","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(97)00219-6_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00219-6_BIB10","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1006\/jctb.1996.0022","article-title":"Well-covered claw-free graphs","volume":"66","author":"Tankus","year":"1996","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0020-0190(97)00219-6_BIB11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(87)90049-1","article-title":"More complicated questions about maxima and minima, and some closures of NP","volume":"51","author":"Wagner","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00219-6_BIB12","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1137\/0219058","article-title":"Bounded query classes","volume":"19","author":"Wagner","year":"1990","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002196?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002196?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T02:41:59Z","timestamp":1758076919000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097002196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0020019097002196"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00219-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1998,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0190(97)00219-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}