{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:52:43Z","timestamp":1725493963048},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671596"},{"type":"electronic","value":"9783540465218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46521-9_12","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T18:47:16Z","timestamp":1194115636000},"page":"137-149","source":"Crossref","is-referenced-by-count":6,"title":["The Online-TSP against Fair Adversaries"],"prefix":"10.1007","author":[{"given":"Michiel","family":"Blom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven O.","family":"Krumke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Willem","family":"de Paepe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leen","family":"Stougie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,2,14]]},"reference":[{"key":"12_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science","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, Lecture Notes in Computer Science, 2000. To appear."},{"key":"12_CR2","unstructured":"G. Ausiello, E. Feuerstein, S. Leonardi, L. Stougie, and M. Talamo. Algorithms for the on-line traveling salesman. Algorithmica, 1999. To appear."},{"key":"12_CR3","unstructured":"A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1023\/A:1009786526733","volume":"1","author":"B. Chen","year":"1997","unstructured":"B. Chen, A. P. A. Vestjens, and G. J. Woeginger. On-line scheduling of two-machine open shops where jobs arrive over time. Journal of Combinatorial Optimization, 1:355\u2013365, 1997.","journal-title":"Journal of Combinatorial Optimization"},{"key":"12_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Online Algorithms: The State of the Art","year":"1998","unstructured":"A. Fiat and G. J. Woeginger, editors. Online Algorithms: The State of the Art, volume 1442 of Lecture Notes in Computer Science. Springer, 1998."},{"key":"12_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-61310-2_30","volume-title":"Proceedings of the 5th Mathematical Programming Society Conference on Integer Programming and Combinatorial Optimization","author":"J. A. Hoogeveen","year":"1996","unstructured":"J. A. Hoogeveen and A. P. A. Vestjens. Optimal on-line algorithms for single-machine scheduling. In Proceedings of the 5th Mathematical Programming Society Conference on Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, pages 404\u2013414, 1996."},{"key":"12_CR7","volume-title":"The online traveling salesman problem on the line","author":"M. Lipmann","year":"1999","unstructured":"M. Lipmann. The online traveling salesman problem on the line. Master\u2019s thesis, Department of Operations Research, University of Amsterdam, The Netherlands, 1999."},{"key":"12_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/3-540-60220-8_53","volume-title":"Proceedings of the 4th Workshop on Algorithms and Data Structures","author":"C. Philips","year":"1995","unstructured":"C. Philips, C. Stein, and J. Wein. Minimizing average completion time in the presence of release dates. In Proceedings of the 4th Workshop on Algorithms and Data Structures, volume 955 of Lecture Notes in Computer Science, pages 86\u201397, 1995."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46521-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T17:00:39Z","timestamp":1551027639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46521-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671596","9783540465218"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-46521-9_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}