{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T23:14:38Z","timestamp":1649114078382},"reference-count":9,"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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0020-0190(98)00003-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"119-123","source":"Crossref","is-referenced-by-count":1,"title":["The NPO-completeness of the longest Hamiltonian cycle problem"],"prefix":"10.1016","volume":"65","author":[{"given":"Q.S.","family":"Wu","sequence":"first","affiliation":[]},{"given":"K.M.","family":"Chao","sequence":"additional","affiliation":[]},{"given":"R.C.T.","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00003-9_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(94)00291-P","article-title":"Approximate solution of NP optimization problems","volume":"150","author":"Ausiello","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(98)00003-9_BIB2","series-title":"Proc. 3rd Ann. 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)00003-9_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","first-page":"56","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(98)00003-9_BIB4","series-title":"Proc. 3rd Workshop on Algorithms and Data Structures","first-page":"421","article-title":"On approximating the longest path in a graph","author":"Karger","year":"1993"},{"key":"10.1016\/S0020-0190(98)00003-9_BIB5","first-page":"374","article-title":"Introduction to Algorithms: A Creative Approach","author":"Manber","year":"1989"},{"key":"10.1016\/S0020-0190(98)00003-9_BIB6","series-title":"Tech. Rept. C-1987-28","article-title":"On approximation preserving reductions: Complete problems and robust measures","author":"Orponen","year":"1987"},{"key":"10.1016\/S0020-0190(98)00003-9_BIB7","first-page":"366","article-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0020-0190(98)00003-9_BIB8","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization approximation, and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/S0020-0190(98)00003-9_BIB9","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000039?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000039?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:54:59Z","timestamp":1556376899000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0020019098000039"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00003-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}