{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:12Z","timestamp":1725664572335},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_63","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:52:15Z","timestamp":1330278735000},"page":"206-217","source":"Crossref","is-referenced-by-count":15,"title":["Competitive algorithms for the on-line traveling salesman"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Ausiello","sequence":"first","affiliation":[]},{"given":"Esteban","family":"Feuerstein","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Leonardi","sequence":"additional","affiliation":[]},{"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[]},{"given":"Maurizio","family":"Talamo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/0217053","volume":"17","author":"M. Atallah","year":"1988","unstructured":"M. Atallah and S. Kosaraju, \u201cEfficient solutions for some transportation problems with application to minimizing robot arm travel\u201d, SIAM J. on Computing, 17 (1988), pp. 849\u2013869.","journal-title":"SIAM J. on Computing"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, M. Talamo, \u201cServing requests with on-line routing\u201d, Proc. of the 4th Scandinavian Workshop on Algorithm Theory, LNCS 824.","DOI":"10.1007\/3-540-58218-5_4"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"R. El-Yaniv, A. Fiat, R.M. Karp and G. Turpin, \u201cCompetitive analysis of financial games\u201d, Proc. 33rd Annual Symposium on Foundations of Computer Science (1992), pp. 327\u2013333.","DOI":"10.1109\/SFCS.1992.267758"},{"key":"18_CR4","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey, and D. Johnson, Computers and intractability: a guide to the theory of NP-completeness, Freeman, San Francisco (1979)."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Y. Karuno, H. Nagamochi and T. Ibaraki, \u201cVehicle scheduling on a tree with release times and handling times\u201d, Proc. 4th. International Symposium on Algorithms and Computation ISAAC'93, LNCS 762 (1993), Springer-Verlag, pp. 486\u2013495.","DOI":"10.1007\/3-540-57568-5_280"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"B. Kalyanasundaram and K.R. Pruhs, \u201cConstructing competitive tours from local information\u201d, Proc. 20th International Colloquium on Automata, Languages and Programming, LNCS 700 (1993), Springer-Verlag.","DOI":"10.1007\/3-540-56939-1_65"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","volume":"11","author":"M. Manasse","year":"1990","unstructured":"M. Manasse, L.A. McGeoch and D. Sleator, \u201cCompetitive algorithms for server problems\u201d, Journal of Algorithms 11 (1990), pp. 208\u2013230.","journal-title":"Journal of Algorithms"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/mnsc.36.2.212","volume":"36-2","author":"H. Psaraftis","year":"1990","unstructured":"H. Psaraftis, M. Solomon, T. Magnanti and T. Kim, \u201cRouting and scheduling on a shoreline with release times\u201d, Management Science 36-2 (1990), pp. 212\u2013223.","journal-title":"Management Science"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"D.B. Shmoys, J. Wein, D.P. Williamson, \u201cScheduling parallel machines on-line\u201d, Proc. of the 32nd Annual Symposium on Foundations of Computer Science, 1991.","DOI":"10.1109\/SFCS.1991.185361"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"D. Sleator, R. Tarjan, \u201cAmortized efficiency of list update and paging rules\u201d, Comm. ACM 28 (1985), pp. 202\u2013208.","journal-title":"Comm. ACM"},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"M. Solomon","year":"1988","unstructured":"M. Solomon and J. Desrosiers, \u201cTime window constrained routing and scheduling problems: a survey\u201d, Transportation Science, 22 (1988), pp. 1\u201313.","journal-title":"Transportation Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:33:46Z","timestamp":1619573626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}