{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:05:08Z","timestamp":1648922708627},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":[[1993,11]]},"DOI":"10.1016\/0020-0190(93)90142-v","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"177-182","source":"Crossref","is-referenced-by-count":3,"title":["The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems"],"prefix":"10.1016","volume":"48","author":[{"given":"Ying Teh","family":"Tsai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90142-V_BIB1","series-title":"Proc. 8th Ann. Symp. on Computational Geometry","article-title":"On-line Steiner trees in the Euclidean plane","author":"Alon","year":"1992"},{"issue":"3","key":"10.1016\/0020-0190(93)90142-V_BIB2","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1137\/0404033","article-title":"Dynamic steiner tree problem","volume":"4","author":"Imase","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0020-0190(93)90142-V_BIB3","series-title":"Proc. 16th Internat. Coll. on Automata, Languages, and Programming","first-page":"687","article-title":"Memory versus randomization in on-line algorithms","volume":"372","author":"Raghavan","year":"1989"},{"issue":"3","key":"10.1016\/0020-0190(93)90142-V_BIB4","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","article-title":"An analysis of several heuristics for the traveling salesman problem","volume":"6","author":"Rosenkrantz","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0020-0190(93)90142-V_BIB5","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","article-title":"Amortized efficiency of list update and paging rules","volume":"28","author":"Sleator","year":"1985","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0020-0190(93)90142-V_BIB6","first-page":"3","article-title":"An on-line algorithm for computing low distance spanning trees on Euclidean space","volume":"22","author":"Tsai","year":"1992","journal-title":"J. Comput. Sci. Inform. India"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390142V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390142V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:28:40Z","timestamp":1555144120000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390142V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["002001909390142V"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90142-v","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}