{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,2]],"date-time":"2023-10-02T22:39:58Z","timestamp":1696286398910},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1991,10]]},"DOI":"10.1016\/s0020-0190(05)80002-x","type":"journal-article","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T21:13:22Z","timestamp":1149714802000},"page":"1-5","source":"Crossref","is-referenced-by-count":15,"title":["A note on the approximation of the max clique problem"],"prefix":"10.1016","volume":"40","author":[{"given":"P.","family":"Crescenzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Fiorini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(05)80002-X_bib1","series-title":"Proc. 6th STACS","first-page":"256","article-title":"On the complexity of approximating the independent set problem","author":"Berman","year":"1989"},{"key":"10.1016\/S0020-0190(05)80002-X_bib2","series-title":"Complexity and Computations","first-page":"43","article-title":"Generalized first-order spectra, and polynomialtime recognizable sets","volume":"7","author":"Fagin","year":"1974"},{"key":"10.1016\/S0020-0190(05)80002-X_bib3","series-title":"Proc. 32th FOCS","article-title":"Approximating clique is almost NP-complete","author":"Feige","year":"1991"},{"key":"10.1016\/S0020-0190(05)80002-X_bib4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321921.321926","article-title":"The complexity of near-optimal graph coloring","volume":"23","author":"Carey","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(05)80002-X_bib5","series-title":"Computational Complexity Theory","first-page":"75","article-title":"Descriptive and computational complexity","volume":"38","author":"Immerman","year":"1989"},{"key":"10.1016\/S0020-0190(05)80002-X_bib6","series-title":"Tech. Rept. UCSC-CRL-90-48","article-title":"Logical definability of NP optimization problems","author":"Kolaitis","year":"1990"},{"key":"10.1016\/S0020-0190(05)80002-X_bib7","series-title":"Proc 22nd ACM STOC","first-page":"446","article-title":"Quantifiers and approximation","author":"Panconesi","year":"1990"},{"key":"10.1016\/S0020-0190(05)80002-X_bib8","series-title":"Combinatorial Optimization: Algorithnu and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0020-0190(05)80002-X_bib9","series-title":"Proc. 10th ACM STOC","first-page":"229","article-title":"Optimization, approximation. and complexity classes","author":"Papadimitriou","year":"1988"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900580002X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900580002X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,16]],"date-time":"2019-01-16T02:20:46Z","timestamp":1547605246000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001900580002X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["S002001900580002X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(05)80002-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}