{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T13:48:31Z","timestamp":1740491311048,"version":"3.38.0"},"reference-count":9,"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\/s0021900200010111","type":"journal-article","created":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T10:49:37Z","timestamp":1459248577000},"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":"S0021900200010111_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11511-010-0046-7"},{"key":"S0021900200010111_ref7","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2012.175.3.2"},{"key":"S0021900200010111_ref6","doi-asserted-by":"publisher","DOI":"10.1051\/jphyslet:0198400450240114500"},{"key":"S0021900200010111_ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0206041"},{"key":"S0021900200010111_ref9","doi-asserted-by":"publisher","DOI":"10.2307\/2304460"},{"volume":"11","journal-title":"Manag. Sci.","year":"1965","key":"S0021900200010111_ref3"},{"volume-title":"Probability for Statistics and Machine Learning","year":"2011","key":"S0021900200010111_ref2"},{"key":"S0021900200010111_ref1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.3.538"},{"volume-title":"Combinatorial Optimization: Algorithms and Complexity","year":"1998","key":"S0021900200010111_ref4"}],"container-title":["Journal of Applied Probability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0021900200010111","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,4,21]],"date-time":"2017-04-21T21:44:28Z","timestamp":1492811068000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0021900200010111\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3]]},"references-count":9,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["S0021900200010111"],"URL":"https:\/\/doi.org\/10.1017\/s0021900200010111","relation":{},"ISSN":["0021-9002","1475-6072"],"issn-type":[{"type":"print","value":"0021-9002"},{"type":"electronic","value":"1475-6072"}],"subject":[],"published":{"date-parts":[[2014,3]]}}}