{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T17:06:38Z","timestamp":1650387998168},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":4429,"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":[[2001,6]]},"DOI":"10.1016\/s0304-3975(00)00140-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"213-226","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic location problems with limited look-ahead"],"prefix":"10.1016","volume":"261","author":[{"given":"Fan","family":"Chung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald","family":"Graham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00140-7_BIB1","doi-asserted-by":"crossref","unstructured":"S. Ben-David, A. Borodin, R. Karp, G. Tardos, A. Wigderson, On the power of randomization in on-line algorithms, Proc. 22nd Symp. on the Theory of Algorithms, ACM, 1990, pp. 379\u2013386.","DOI":"10.1145\/100216.100268"},{"key":"10.1016\/S0304-3975(00)00140-7_BIB2","first-page":"74","article-title":"The server problem and on-line games","volume":"vol. 7","author":"Chrobak","year":"1992"},{"key":"10.1016\/S0304-3975(00)00140-7_BIB3","series-title":"Discrete Algorithms and Complexity","first-page":"351","article-title":"Dynamic search in graphs","author":"Chung","year":"1987"},{"key":"10.1016\/S0304-3975(00)00140-7_BIB4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02124674","article-title":"A dynamic location problem for graphs","volume":"9","author":"Chung","year":"1989","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(00)00140-7_BIB5","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/S0022-0000(05)80060-1","article-title":"Competitive k-server algorithms, Proc. 31st Ann. Symp. on Foundation of Computer Sciences","volume":"48","author":"Fiat","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00140-7_BIB6","doi-asserted-by":"crossref","unstructured":"A. Fiat, G.J. Woeginger (Eds.), Online Algorithms: State of the Art, Springer, Berlin, 1998.","DOI":"10.1007\/BFb0029561"},{"key":"10.1016\/S0304-3975(00)00140-7_BIB7","first-page":"65","article-title":"The harmonic on-line k-server algorithm is competitive","volume":"vol. 7","author":"Grove","year":"1992"},{"key":"10.1016\/S0304-3975(00)00140-7_BIB8","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","article-title":"Competitive algorithms for server problems","volume":"11","author":"Manasse","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(00)00140-7_BIB9","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1287\/moor.13.4.606","article-title":"A limit theorem for (min,+) matrix multiplication","volume":"13","author":"Saks","year":"1988","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0304-3975(00)00140-7_BIB10","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency for list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001407?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001407?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T04:48:05Z","timestamp":1578458885000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0304397500001407"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00140-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}