{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:53:38Z","timestamp":1742637218603,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/acc.2011.5991534","type":"proceedings-article","created":{"date-parts":[[2014,7,16]],"date-time":"2014-07-16T17:51:28Z","timestamp":1405533088000},"page":"2789-2794","source":"Crossref","is-referenced-by-count":3,"title":["Approximation algorithms for a heterogeneous Multiple Depot Hamiltonian Path Problem"],"prefix":"10.1109","author":[{"given":"S.","family":"Yadlapalli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Jungyun Bae","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Rathinam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Darbha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2009","author":"helsgaun","key":"17"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1109\/ACC.2009.5160738"},{"year":"0","author":"seik","journal-title":"Boost Graph Library The User Guide and Reference Manual","key":"15"},{"year":"0","key":"16"},{"year":"2009","journal-title":"Graph Theory Toolbox by Sergii Iglin","key":"13"},{"year":"2008","journal-title":"MatlabBGL by David Gleich","key":"14"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1109\/CCA.2006.286066"},{"year":"2001","author":"vazirani","journal-title":"Approximation Algorithms","key":"12"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1016\/0167-6377(91)90016-I"},{"year":"1976","author":"christofides","journal-title":"Worst-case analysis of a new heuristic for the traveling salesman problem","key":"2"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1109\/ACC.1998.694698"},{"year":"2002","author":"gutin","journal-title":"The Travelling Salesman Problem and its Variations","key":"10"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/CDC.2006.377732"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/TASE.2006.872110"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1016\/j.orl.2007.02.001"},{"key":"4","first-page":"343","article-title":"Auction-Based Multi-Robot Routing","author":"lagoudakis","year":"2005","journal-title":"Proceedings of the International Conference on Robotics Science and Systems"},{"key":"9","article-title":"The Traveling Salesman-computational solutions for TSP allocations","volume":"840","author":"reinelt","year":"1994","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1016\/j.orl.2009.10.001"}],"event":{"name":"2011 American Control Conference","start":{"date-parts":[[2011,6,29]]},"location":"San Francisco, CA","end":{"date-parts":[[2011,7,1]]}},"container-title":["Proceedings of the 2011 American Control Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5975310\/5989965\/05991534.pdf?arnumber=5991534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T08:40:08Z","timestamp":1490085608000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5991534\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/acc.2011.5991534","relation":{},"subject":[],"published":{"date-parts":[[2011,6]]}}}