{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:49:57Z","timestamp":1648630197214},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3850,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s0304-3975(02)00091-9","type":"journal-article","created":{"date-parts":[[2003,2,4]],"date-time":"2003-02-04T20:51:53Z","timestamp":1044391913000},"page":"2037-2044","source":"Crossref","is-referenced-by-count":3,"title":["Approximate sequencing for variable length tasks"],"prefix":"10.1016","volume":"290","author":[{"given":"Mao-Cheng","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaotie","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0304-3975(02)00091-9_BIB1","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1137\/S009753979732428X","article-title":"Exploring unknown environments","volume":"29","author":"Albers","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(02)00091-9_BIB2","doi-asserted-by":"crossref","unstructured":"Analysis and characterization of large-scale Web server access patterns and performance, World Wide Web 2 (1999) 85\u2013100.","DOI":"10.1023\/A:1019244621570"},{"key":"10.1016\/S0304-3975(02)00091-9_BIB3","series-title":"Dynamic Programming","author":"Bellman","year":"1957"},{"key":"10.1016\/S0304-3975(02)00091-9_BIB4","unstructured":"A. Czumaj, I. Finch, L. Ga\u0327sieniec, A. Gibbons, P. Leng, W. Rytter, M. Zito, Efficient web searching using temporal factors, Algorithms and data structures, Vancouver, BC, Lecture Notes in Computer Science, Vol. 1663, Springer, Berlin, 1999, pp. 294\u2013305."},{"issue":"3","key":"10.1016\/S0304-3975(02)00091-9_BIB5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","article-title":"Exploring an unknown graph","volume":"32","author":"Deng","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0304-3975(02)00091-9_BIB6","series-title":"Computers and Intractability","author":"Garey","year":"1979"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000919?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502000919?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T08:00:20Z","timestamp":1555920020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502000919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S0304397502000919"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00091-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,1]]}}}