{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:39Z","timestamp":1725558399130},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_13","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T07:00:50Z","timestamp":1276153250000},"page":"127-138","source":"Crossref","is-referenced-by-count":7,"title":["A 3\/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Zhou","family":"Xu","sequence":"first","affiliation":[]},{"given":"Brian","family":"Rodrigues","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2005.01.007","volume":"59","author":"E.M. Arkin","year":"2006","unstructured":"Arkin, E.M., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems. Journal of Algorithms\u00a059(1), 1\u201318 (2006)","journal-title":"Journal of Algorithms"},{"key":"13_CR2","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem, Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University (1976)"},{"issue":"2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/opre.43.2.231","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part i: The chinese postman problem. Operations Research\u00a043(2), 231\u2013242 (1995)","journal-title":"Operations Research"},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"H.A. Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part ii: The rural postman problem. Operations Research\u00a043(3), 399\u2013414 (1995)","journal-title":"Operations Research"},{"key":"13_CR5","volume-title":"Computers and Intractability: a Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-completeness. Freeman, New York (1979)"},{"issue":"9","key":"13_CR6","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1057\/palgrave.jors.2601426","volume":"53","author":"I.D. Giosa","year":"2002","unstructured":"Giosa, I.D., Tansini, I.L., Viera, I.O.: New assignment algorithms for the multi-depot vehicle routing problem. Journal of the Operational Research Society\u00a053(9), 977\u2013984 (2002)","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TASE.2005.853472","volume":"2","author":"A. Lim","year":"2005","unstructured":"Lim, A., Wang, F.: Multi-depot vehicle routing problem: a one-stage approach. IEEE Transactions on Automation Science and Engineering\u00a02(4), 397\u2013402 (2005)","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"issue":"6","key":"13_CR8","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1016\/j.orl.2007.02.001","volume":"35","author":"W. Malik","year":"2007","unstructured":"Malik, W., Rathinam, S., Darbha, S.: An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem. Operations Research Letters\u00a035(6), 747\u2013753 (2007)","journal-title":"Operations Research Letters"},{"key":"13_CR9","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Approximation algorithms for the traveling salesman problem. In: Combinatorial Optimization: Algorithms and Complexity, pp. 410\u2013419. Courier Dover Publications (1998)"},{"key":"13_CR10","unstructured":"Rathinam, S., Sengupta, R.: 3\/2-Approximation Algorithm for a Generalized, Multiple Depot, Hamiltonina Path Problem. Technical report, University of California, Berkeley (2007)"},{"key":"13_CR11","unstructured":"Rathinam, S., Sengupta, R.: 5\/3-approximation algorithm for a multiple depot, terminal hamiltonian path problem. Technical report, University of California, Berkeley (2007)"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/TASE.2006.872110","volume":"4","author":"S. Rathinam","year":"2006","unstructured":"Rathinam, S., Sengupta, R., Darbha, S.: A resource allocation algorithm for multi-vehicle systems with non holonomic constraints. IEEE Transactions on Automation Sciences and Engineering\u00a04(1), 98\u2013104 (2006)","journal-title":"IEEE Transactions on Automation Sciences and Engineering"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.orl.2009.10.001","volume":"38","author":"S. Rathinama","year":"2010","unstructured":"Rathinama, S., Senguptab, R.: 3\/2-approximation algorithm for two variants of a 2-depot hamiltonian path problem. Operations Research Letters\u00a038(1), 63\u201368 (2010)","journal-title":"Operations Research Letters"},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","volume":"23","author":"J. Renaud","year":"1996","unstructured":"Renaud, J., Laporte, G., Boctor, F.F.: A tabu search heuristic for the multi-depot vehicle routing problem. Computers and Operations Research\u00a023(3), 229\u2013235 (1996)","journal-title":"Computers and Operations Research"},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"D.J. Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing\u00a06(3), 563\u2013581 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR16","first-page":"664","volume-title":"Integer and Combinatorial Optimization, ch. section III.3","author":"L.A. Wolsey","year":"1988","unstructured":"Wolsey, L.A., Nemhauser, G.L.: Integer and Combinatorial Optimization, ch. section III.3, p. 664. Wiley-Interscience, Hoboken (1988)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:40:43Z","timestamp":1578519643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_13"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}