{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:10:49Z","timestamp":1737436249044,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441861"},{"type":"electronic","value":"9783540457534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45753-4_18","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T11:37:09Z","timestamp":1187264229000},"page":"200-214","source":"Crossref","is-referenced-by-count":14,"title":["Non-abusiveness Helps: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbuLwBLnhiov2DGi1BTfMBaeHb % d9wDYLwzYbItLDharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaadeWaaq % aadaqbaaGcbaGaaGOmamaaCaaaleqabaGagiiBaWMaei4Ba8Maei4z % aCgaaOWaaWbaaSqabeaadaahaaadbeqaamaaBaaabaWaaWbaaeqaba % GaaGymaiabgkHiTiabgIGiodaaaeqaaaaaaaGcdaahaaWcbeqaaiab % d6gaUbaaaaa!4546! \\[ 2^{\\log } ^{^{_{^{1 - \\in } } } } ^n \\] (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Sven O.","family":"Krumke","sequence":"first","affiliation":[]},{"given":"Luigi","family":"Laura","sequence":"additional","affiliation":[]},{"given":"Maarten","family":"Lipmann","sequence":"additional","affiliation":[]},{"given":"Alberto","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[]},{"given":"Willem E.","family":"de Paepe","sequence":"additional","affiliation":[]},{"given":"Diana","family":"Poensgen","sequence":"additional","affiliation":[]},{"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"key":"18_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1007\/3-540-46541-3_53","volume-title":"Online dial-a-ride problems: Minimizing the completion time","author":"N. Ascheuer","year":"2000","unstructured":"N. Ascheuer, S. O. Krumke, and J. Rambau. Online dial-a-ride problems: Minimizing the completion time. In Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science, volume 1770 of Lecture Notes in Computer Science, pages 639\u2013650. Springer, 2000."},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/s004530010071","volume":"29","author":"G. Ausiello","year":"2001","unstructured":"G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo. Algorithms for the on-line traveling salesman. Algorithmica, 29(4):560\u2013581, 2001.","journal-title":"Algorithmica"},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1287\/ijoc.13.2.138.10517","volume":"13","author":"M. Blom","year":"2001","unstructured":"M. Blom, S. O. Krumke, W. E. de Paepe, and L. Stougie. The online-TSP against fair adversaries. Informs Journal on Computing, 13(2):138\u2013148, 2001.","journal-title":"Informs Journal on Computing"},{"key":"18_CR4","unstructured":"A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"E. Feuerstein and L. Stougie. On-line single server dial-a-ride problems. Theoretical Computer Science, 2001. To appear.","DOI":"10.1016\/S0304-3975(00)00261-9"},{"key":"18_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Theoretical Computer Science","author":"D. Hauptmeier","year":"2001","unstructured":"D. Hauptmeier, S. O. Krumke, and J. Rambau. The online dial-a-ride problem under reasonable load. Theoretical Computer Science, 2001. A preliminary version appeared in the Proceedings of the 4th Italian Conference on Algorithms and Complexity, 2000, vol. 1767 of Lecture Notes in Computer Science."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"H. Kellerer, Th. Tautenhahn, and G. J. Woeginger. Approximability and nonapproximability results for minimizing total flow time on a single machine. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pages 418\u2013426, 1996.","DOI":"10.1145\/237814.237989"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"E. Koutsoupias and C. Papadimitriou. Beyond competitive analysis. In Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science, pages 394\u2013400, 1994.","DOI":"10.1109\/SFCS.1994.365677"},{"key":"18_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/3-540-44683-4_43","volume-title":"News from the online traveling repairman","author":"S. O. Krumke","year":"2001","unstructured":"S. O. Krumke, W. E. de Paepe, D. Poensgen, and L. Stougie. News from the online traveling repairman. In Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, volume 2136 of Lecture Notes in Computer Science, pages 487\u2013499, 2001."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.","DOI":"10.1017\/CBO9780511814075"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"K. Pruhs and B. Kalyanasundaram. Speed is as powerful as clairvoyance. In Proceedings of the 36th Annual IEEE Symposium on the Foundations of Computer Science, pages 214\u2013221, 1995.","DOI":"10.1109\/SFCS.1995.492478"}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45753-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T11:38:32Z","timestamp":1737373112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45753-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441861","9783540457534"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45753-4_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}