{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:19:58Z","timestamp":1759666798767},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0377-2217(02)00433-2","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:24:07Z","timestamp":1051741447000},"page":"584-590","source":"Crossref","is-referenced-by-count":7,"title":["An approximation algorithm for computing longest paths"],"prefix":"10.1016","volume":"148","author":[{"given":"Maria","family":"Grazia Scutell\u00e0","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00433-2_BIB1","series-title":"Network Flows: Theory, algorithms and applications","author":"Ahuja","year":"1993"},{"issue":"4","key":"10.1016\/S0377-2217(02)00433-2_BIB2","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","article-title":"Color-coding","volume":"42","author":"Alon","year":"1995","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(02)00433-2_BIB3","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","article-title":"Strong NP-completeness results: Motivation, examples and implications","volume":"25","author":"Garey","year":"1978","journal-title":"Journal of the Association of Computing Machinery"},{"key":"10.1016\/S0377-2217(02)00433-2_BIB4","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF02523689","article-title":"On approximating the longest path in a graph","volume":"18","author":"Karger","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0377-2217(02)00433-2_BIB5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","article-title":"A characterization of the minimum cycle mean in a diagraph","volume":"23","author":"Karp","year":"1978","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0377-2217(02)00433-2_BIB6","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors. II. Algorithmic aspects of tree-width","volume":"7","author":"Robertson","year":"1986","journal-title":"Journal of Algorithms"},{"issue":"5","key":"10.1016\/S0377-2217(02)00433-2_BIB7","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1137\/0219054","article-title":"The spatial complexity of oblivious k-probe hash functions","volume":"19","author":"Schmidt","year":"1990","journal-title":"Siam Journal on Computing"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004332?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702004332?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T13:21:47Z","timestamp":1553952107000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702004332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0377221702004332"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00433-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}