{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T08:40:35Z","timestamp":1682498435189},"reference-count":3,"publisher":"Cambridge University Press (CUP)","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Appl. Probab."],"published-print":{"date-parts":[[2014,3]]},"abstract":"<jats:p>In this work we consider the <jats:italic>mean-field traveling salesman problem<\/jats:italic>, where the intercity distances are taken to be independent and identically distributed with some distribution <jats:italic>F<\/jats:italic>. We consider the simplest approximation algorithm, namely, the <jats:italic>nearest-neighbor algorithm<\/jats:italic>, where the rule is to move to the nearest nonvisited city. We show that the limiting behavior of the total length of the nearest-neighbor tour depends on the scaling properties of the density of <jats:italic>F<\/jats:italic> at 0 and derive the limits for all possible cases of general <jats:italic>F<\/jats:italic>.<\/jats:p>","DOI":"10.1017\/s0001867800010119","type":"journal-article","created":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T14:49:37Z","timestamp":1459262977000},"page":"106-117","source":"Crossref","is-referenced-by-count":0,"title":["On the Nearest-Neighbor Algorithm for the Mean-Field Traveling Salesman Problem"],"prefix":"10.1017","volume":"51","author":[{"given":"Antar","family":"Bandyopadhyay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farkhondeh","family":"Sajadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2016,2,19]]},"reference":[{"key":"S0001867800010119_ref3","volume":"11","year":"1965","journal-title":"Manag. Sci."},{"key":"S0001867800010119_ref4","volume-title":"Combinatorial Optimization: Algorithms and Complexity","year":"1998"},{"key":"S0001867800010119_ref2","volume-title":"Probability for Statistics and Machine Learning","year":"2011"}],"container-title":["Journal of Applied Probability"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T08:07:03Z","timestamp":1682496423000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0001867800010119\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":3,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["S0001867800010119"],"URL":"https:\/\/doi.org\/10.1017\/s0001867800010119","relation":{},"ISSN":["0021-9002","1475-6072"],"issn-type":[{"value":"0021-9002","type":"print"},{"value":"1475-6072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}