Translator Disclaimer
March 2014 On the nearest-neighbor algorithm for the mean-field traveling salesman problem
Antar Bandyopadhyay, Farkhondeh Sajadi
Author Affiliations +
J. Appl. Probab. 51(1): 106-117 (March 2014). DOI: 10.1239/jap/1395771417

Abstract

In this work we consider the mean-field traveling salesman problem, where the intercity distances are taken to be independent and identically distributed with some distribution F. We consider the simplest approximation algorithm, namely, the nearest-neighbor algorithm, 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 F at 0 and derive the limits for all possible cases of general F.

Citation

Download Citation

Antar Bandyopadhyay. Farkhondeh Sajadi. "On the nearest-neighbor algorithm for the mean-field traveling salesman problem." J. Appl. Probab. 51 (1) 106 - 117, March 2014. https://doi.org/10.1239/jap/1395771417

Information

Published: March 2014
First available in Project Euclid: 25 March 2014

zbMATH: 1321.90114
MathSciNet: MR3189445
Digital Object Identifier: 10.1239/jap/1395771417

Subjects:
Primary: 60K37
Secondary: 05C85, 68Q87, 68W25

Rights: Copyright © 2014 Applied Probability Trust

JOURNAL ARTICLE
12 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.51 • No. 1 • March 2014
Back to Top