{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T10:10:10Z","timestamp":1746439810614,"version":"3.40.4"},"publisher-location":"Singapore","reference-count":8,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819644445","type":"print"},{"value":"9789819644452","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-4445-2_14","type":"book-chapter","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:34:01Z","timestamp":1746437641000},"page":"163-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Competitive Algorithms for\u00a0Online Traveling Salesman Problem on\u00a0a\u00a0Semi-line"],"prefix":"10.1007","author":[{"given":"Qian","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2622-5158","authenticated-orcid":false,"given":"An","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangting","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,6]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Bampis, E., Escoffier, B., Hahn N., Xefteris, M.: Online TSP with known locations. In: 18th Algorithms and Data Structures Symposium, pp. 65\u201378 (2023)","DOI":"10.1007\/978-3-031-38906-1_5"},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1287\/ijoc.13.2.138.10517","volume":"13","author":"M Blom","year":"2001","unstructured":"Blom, M., Krumke, S.-O., de Paepe, W., Stougie, L.: The online TSP against fair adversaries. INFORMS J. Comput. 13(2), 138\u2013148 (2001)","journal-title":"INFORMS J. Comput."},{"key":"14_CR3","unstructured":"Chen, P.-C., Demaine, Erik D., Liao, C.-S., Wei, H. -T.: Waiting is not easy but worth it: the online TSP on the line revisited (2019). arXiv:1907.00317"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Gouleakis, T., Lakis, K., Shahkarami, G.: Learning-augmented algorithms for online TSP on the line. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 10, pp. 11989\u201311996 (2023)","DOI":"10.1609\/aaai.v37i10.26414"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-030-14812-6_20","volume-title":"Theory and Applications of Models of Computation","author":"VA Jawgal","year":"2019","unstructured":"Jawgal, V.A., Muralidhara, V.N., Srinivasan, P.S.: Online travelling salesman problem on a circle. In: Gopal, T.V., Watada, J. (eds.) TAMC 2019. LNCS, vol. 11436, pp. 325\u2013336. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14812-6_20"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/s004530010071","volume":"29","author":"G Ausiello","year":"2001","unstructured":"Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L., Talamo, M.: Algorithms for the on-line travelling salesman$$^1$$. Algorithmica 29, 560\u2013581 (2001)","journal-title":"Algorithmica"},{"key":"14_CR7","unstructured":"Bampis, E., et al.: Learning-augmented online TSP on rings, trees, flowers and (Almost) everywhere else. In: 31st Annual European Symposium on Algorithms, LIPIcs 274, pp. 1\u201317 (2023)"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3422362","volume":"17","author":"A Bjelde","year":"2021","unstructured":"Bjelde, A., et al.: Tight bounds for online TSP on the line. ACM Trans. Algorithms 17(1), 1\u201358 (2021)","journal-title":"ACM Trans. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-4445-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:34:06Z","timestamp":1746437646000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4445-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819644445","9789819644452"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4445-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"6 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cocoa2024.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}