{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T00:10:15Z","timestamp":1791331815677,"version":"4.3.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":[[2002,9]]},"DOI":"10.1016\/s0020-0190(02)00205-3","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"287-291","source":"Crossref","is-referenced-by-count":99,"title":["An improved FPTAS for Restricted Shortest Path"],"prefix":"10.1016","volume":"83","author":[{"given":"Funda","family":"Ergun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rakesh","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lisa","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00205-3_BIB001","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(02)00205-3_BIB002","series-title":"Proceedings INFOCOM","article-title":"Efficient computation of delay-sensitive routes from one source to all destinations","author":"Goel","year":"2001"},{"issue":"1","key":"10.1016\/S0020-0190(02)00205-3_BIB003","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","article-title":"Approximation schemes for the restricted shortest path problems","volume":"17","author":"Hassin","year":"1992","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0020-0190(02)00205-3_BIB004","series-title":"Proceedings 25th Annual ACM Symposium on the Theory of Computing, San Diego, CA","first-page":"776","article-title":"The network inhibition problem","author":"Phillips","year":"1993"},{"key":"10.1016\/S0020-0190(02)00205-3_BIB005","series-title":"Simple efficient approximation scheme for the restricted shortest path problem, Technical Report 10009674-991214-04TM","author":"Raz","year":"1999"},{"key":"10.1016\/S0020-0190(02)00205-3_BIB006","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","article-title":"Algorithms for scheduling independent tasks","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(02)00205-3_BIB007","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","article-title":"Approximation of Pareto optima in multiple-objective, shortest path problems","volume":"35","author":"Warburton","year":"1987","journal-title":"Oper. Res."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002002053?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T20:58:53Z","timestamp":1556830733000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002002053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0020019002002053"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00205-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}