{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T05:34:00Z","timestamp":1734586440571,"version":"3.30.2"},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2005,7,1]],"date-time":"2005-07-01T00:00:00Z","timestamp":1120176000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2005,7]]},"DOI":"10.1016\/j.orl.2004.08.002","type":"journal-article","created":{"date-parts":[[2004,10,13]],"date-time":"2004-10-13T17:53:40Z","timestamp":1097690020000},"page":"403-410","source":"Crossref","is-referenced-by-count":9,"title":["Approximation algorithms for the Euclidean bipartite TSP"],"prefix":"10.1016","volume":"33","author":[{"given":"Andreas","family":"Baltz","sequence":"first","affiliation":[]},{"given":"Anand","family":"Srivastav","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2004.08.002_bib1","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF02579135","article-title":"On optimal matchings","volume":"4","author":"Ajtai","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/j.orl.2004.08.002_bib2","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/net.3230220408","article-title":"The swapping problem","volume":"22","author":"Anily","year":"1992","journal-title":"Networks"},{"key":"10.1016\/j.orl.2004.08.002_bib3","doi-asserted-by":"crossref","unstructured":"S. Arora, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 2\u201312.","DOI":"10.1109\/SFCS.1996.548458"},{"key":"10.1016\/j.orl.2004.08.002_bib4","doi-asserted-by":"crossref","unstructured":"S. Arora, Nearly linear time approximation schemes for Euclidean TSP and other geometric problems, Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, 1997.","DOI":"10.1109\/SFCS.1997.646145"},{"key":"10.1016\/j.orl.2004.08.002_bib5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S0305004100034095","article-title":"The shortest path through many points","volume":"55","author":"Beardwood","year":"1959","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/j.orl.2004.08.002_bib6","unstructured":"P. Chalasani, R. Motwani, A. Rao, Approximation algorithms for robot grasp and delivery, Proceedings of the 2nd International Workshop on Algebraic Foundations of Robotics, 1996."},{"key":"10.1016\/j.orl.2004.08.002_bib7","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","article-title":"A weighted matroid intersection algorithm","volume":"2","author":"Frank","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/j.orl.2004.08.002_bib8","unstructured":"A. Frank, B. Korte, E. Triesch, J. Vygen, On the bipartite travelling salesman problem, Report No. 98866-OR, University of Bonn, 1998."},{"key":"10.1016\/j.orl.2004.08.002_bib9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1014923704338","article-title":"Approximation algorithms for pick-and-place robots","volume":"107","author":"Michel","year":"2001","journal-title":"Ann. Oper. Res."},{"year":"1988","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","key":"10.1016\/j.orl.2004.08.002_bib10"},{"key":"10.1016\/j.orl.2004.08.002_bib11","doi-asserted-by":"crossref","unstructured":"S.B. Rao, W.D. Smith, Approximating geometric graphs via \u201cspanners\u201d and \u201cbanyans\u201d, Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, 1998, pp. 540\u2013550.","DOI":"10.1145\/276698.276868"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704001257?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704001257?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T00:39:28Z","timestamp":1734568768000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637704001257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,7]]}},"alternative-id":["S0167637704001257"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2004.08.002","relation":{},"ISSN":["0167-6377"],"issn-type":[{"type":"print","value":"0167-6377"}],"subject":[],"published":{"date-parts":[[2005,7]]}}}