{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:36:51Z","timestamp":1725482211070},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_6","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T12:02:55Z","timestamp":1175774575000},"page":"42-54","source":"Crossref","is-referenced-by-count":3,"title":["Euler Is Standing in Line"],"prefix":"10.1007","author":[{"given":"D.","family":"Hauptmeier","sequence":"first","affiliation":[]},{"given":"S. O.","family":"Krumke","sequence":"additional","affiliation":[]},{"given":"J.","family":"Rambau","sequence":"additional","affiliation":[]},{"given":"H.-C.","family":"Wirth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","volume-title":"Networks flows","author":"R. K. Ahuja","year":"1993","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Networks flows, Prentice Hall, Englewood Cliffs, New Jersey, 1993. 52, 53"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"N. Ascheuer, M. Gr\u00f6tschel, S. O. Krumke, and J. Rambau, Combinatorial online optimization, Proceedings of the International Conference of Operations Research (OR\u201998), Springer, 1998, pp. 21\u201337.","DOI":"10.1007\/978-3-642-58409-1_2"},{"issue":"5","key":"6_CR3","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/0217053","volume":"17","author":"M. J. Atallah","year":"1988","unstructured":"M. J. Atallah and S. R. Kosaraju, Efficient solutions to some transportation problems with applications to minimizing robot arm travel, SIAMJournal on Computing 17 (1988), no. 5, 849\u2013869. 44, 45, 46, 46, 49","journal-title":"SIAMJournal on Computing"},{"key":"6_CR4","series-title":"Tech. report","volume-title":"Worst-case analysis of a new heuristic for the traveling salesman problem","author":"N. Christofides","year":"1976","unstructured":"N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Tech. report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976. 52"},{"key":"6_CR5","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms, MIT Press, 1990. 53"},{"issue":"6","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1137\/0221066","volume":"21","author":"G. N. Frederickson","year":"1992","unstructured":"G. N. Frederickson and D. J. Guan, Preemptive ensemble motion planning on a tree, SIAM Journal on Computing 21 (1992), no. 6, 1130\u20131152.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1006\/jagm.1993.1029","volume":"15","author":"G. N. Frederickson","year":"1993","unstructured":"G. N. Frederickson and D. J. Guan, Nonpreemptive ensemble motion planning on a tree, Journal of Algorithms 15 (1993), no. 1, 29\u201360. 43, 44, 45, 45, 45, 46, 46","journal-title":"Journal of Algorithms"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G. N. Frederickson","year":"1978","unstructured":"G. N. Frederickson, M. S. Hecht, and C. E. Kim, Approximation algorithms for some routing problems, SIAM Journal on Computing 7 (1978), no. 2, 178\u2013193. 44, 46, 49","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"6_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0166-218X(97)00074-7","volume":"81","author":"D. J. Guan","year":"1998","unstructured":"D. J. Guan, Routing a vehicle of capacity greater than one, Discrete Applied Mathematics 81 (1998), no. 1, 41\u201357.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM Journal on Computing 13 (1984), no. 2, 338\u2013355. 53","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin, On finding lowest common ancestors: Simplification and parallelization, SIAM Journal on Computing 17 (1988), no. 6, 1253\u20131262. 53","journal-title":"SIAM Journal on Computing"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1002\/net.3230070103","volume":"7","author":"R. E. Tarjan","year":"1977","unstructured":"R. E. Tarjan, Finding optimum branchings, Networks 7 (1977), 25\u201335. 49, 53","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T03:38:11Z","timestamp":1556336291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}