{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T04:31:50Z","timestamp":1714624310387},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"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":[[1998,12]]},"DOI":"10.1016\/s0020-0190(98)00170-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:25:26Z","timestamp":1049721926000},"page":"249-253","source":"Crossref","is-referenced-by-count":3,"title":["Near-optimal nonapproximability results for some Npo PB-complete problems"],"prefix":"10.1016","volume":"68","author":[{"given":"P.","family":"Jonsson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00170-7_BIB1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0890-5401(92)90056-L","article-title":"On the complexity of approximating the independent set problem","volume":"96","author":"Berman","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(98)00170-7_BIB2","series-title":"Proc. 3rd Annual ACM Symp. on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0020-0190(98)00170-7_BIB3_1","series-title":"Electronic Colloquium on Computational Complexity","article-title":"Clique is hard to approximate within n1 \u2212 \u03b5","author":"H\u00e5stad","year":"1997"},{"key":"10.1016\/S0020-0190(98)00170-7_BIB3_2","series-title":"Proc. 37th Ann. IEEE Symp. on Foundations of Computer Science","first-page":"627","author":"H\u00e5stad","year":"1996"},{"key":"10.1016\/S0020-0190(98)00170-7_BIB4","article-title":"On the approximability of NP-complete optimization problems","author":"Kann","year":"1992"},{"key":"10.1016\/S0020-0190(98)00170-7_BIB5","first-page":"317","article-title":"Polynomially bounded minimization problems that are hard to approximate","volume":"1","author":"Kann","year":"1994","journal-title":"Nordic J. Comput."},{"key":"10.1016\/S0020-0190(98)00170-7_BIB6","series-title":"Proc. 20th Internat. Symp. on Mathematical Foundations of Computer Science","first-page":"227","article-title":"Strong lower bounds on the approximability of some NPO PB-complete maximization problems","author":"Kann","year":"1995"},{"key":"10.1016\/S0020-0190(98)00170-7_BIB7","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001707?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001707?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:28:47Z","timestamp":1556044127000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098001707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0020019098001707"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00170-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}