{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:51:56Z","timestamp":1743126716839,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319165943"},{"type":"electronic","value":"9783319165950"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-16595-0_36","type":"book-chapter","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T13:42:10Z","timestamp":1430314930000},"page":"627-640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An Approximation Algorithm for Time Optimal Multi-Robot Routing"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Turpin","sequence":"first","affiliation":[]},{"given":"Nathan","family":"Michael","sequence":"additional","affiliation":[]},{"given":"Vijay","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,30]]},"reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2005.01.007","volume":"59","author":"EM Arkin","year":"2006","unstructured":"Arkin, E.M., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59(1), 1\u201318 (2006)","journal-title":"J. Algorithms"},{"issue":"3","key":"36_CR2","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0167-6377(92)90103-A","volume":"12","author":"RD Armstrong","year":"1992","unstructured":"Armstrong, R.D., Jin, Z.: Solving linear bottleneck assignment problems via strong spanning trees. Oper. Res. Lett. 12(3), 179\u2013180 (1992)","journal-title":"Oper. Res. Lett."},{"doi-asserted-by":"crossref","unstructured":"Burkard, R.E., Cela, E.: Linear Assignment Problems and Extensions. Springer, Berlin (1999)","key":"36_CR3","DOI":"10.1007\/978-1-4757-3023-4_2"},{"doi-asserted-by":"crossref","unstructured":"Carlsson, J., Ge, D., Subramaniam, A., Wu, A., Ye, Y.: Solving min-max multi-depot vehicle routing problem. Lectures on Global Optimization. Fields Institute Communications, vol. 55, pp. 31-46 (2009)","key":"36_CR4","DOI":"10.1090\/fic\/055\/03"},{"unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, DTIC Document (1976)","key":"36_CR5"},{"issue":"2","key":"36_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1287\/ijoc.11.2.138","volume":"11","author":"W Cook","year":"1999","unstructured":"Cook, W., Rohe, A.: Computing minimum-weight perfect matchings. INFORMS J. Comput. 11(2), 138\u2013148 (1999)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"36_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"4","key":"36_CR8","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","volume":"57","author":"B Eksioglu","year":"2009","unstructured":"Eksioglu, B., Vural, A.V., Reisman, A.: The vehicle routing problem: a taxonomic review. Comput. Ind. Eng. 57(4), 1472\u20131483 (2009)","journal-title":"Comput. Ind. Eng."},{"doi-asserted-by":"crossref","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. In: 17th Annual Symposium on Foundations of Computer Science, pp. 216\u2013227. IEEE (1976)","key":"36_CR9","DOI":"10.1109\/SFCS.1976.6"},{"issue":"3","key":"36_CR10","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM (JACM) 34(3), 596\u2013615 (1987)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/BF01442866","volume":"6","author":"C Hierholzer","year":"1873","unstructured":"Hierholzer, C., Wiener, C.: \u00dcber die m\u00f6glichkeit, einen linienzug ohne wiederholung und ohne unterbrechung zu umfahren. Mathematische Annalen 6(1), 30\u201332 (1873)","journal-title":"Mathematische Annalen"},{"issue":"1","key":"36_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s12532-009-0002-8","volume":"1","author":"V Kolmogorov","year":"2009","unstructured":"Kolmogorov, V., Blossom, V.: A new implementation of a minimum cost perfect matching algorithm. Math. Program. Comput. 1(1), 43\u201367 (2009)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"36_CR13","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"JB Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc. Am. Math. Soc. 7(1), 48\u201350 (1956)","journal-title":"Proc. Am. Math. Soc."},{"unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Courier Dover Publications (1976)","key":"36_CR14"},{"issue":"1","key":"36_CR15","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2002.11.003","volume":"162","author":"G Nagy","year":"2005","unstructured":"Nagy, G., Salhi, S.D.: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur. J. Oper. Res. 162(1), 126\u2013141 (2005)","journal-title":"Eur. J. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Ren, C.: Solving min-max vehicle routing problem. J. Softw. (1796217X) 6(9) (2011)","key":"36_CR16","DOI":"10.4304\/jsw.6.9.1851-1856"},{"doi-asserted-by":"crossref","unstructured":"Xu, Z., Rodrigues, B.: A 3\/2-approximation algorithm for multiple depot multiple traveling salesman problem. In: Algorithm Theory-SWAT 2010, pp. 127\u2013138. Springer, Berlin (2010)","key":"36_CR17","DOI":"10.1007\/978-3-642-13731-0_13"}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundations of Robotics XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16595-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T12:53:13Z","timestamp":1676638393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16595-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319165943","9783319165950"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16595-0_36","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}