Open AccessComplete Convergence of Short Paths and Karp's Algorithm for the TSP
Author(s) -
John Steele
Publication year - 1981
Publication title -
mathematics of operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.619
H-Index - 83
eISSN - 1526-5471
pISSN - 0364-765X
DOI - 10.1287/moor.6.3.374
Subject(s) - mathematics , travelling salesman problem , combinatorics , constant (computer programming) , convergence (economics) , path (computing) , shortest path problem , discrete mathematics , algorithm , computer science , graph , economics , programming language , economic growth
Let Xi, 1 ≤ i 2 and let Tn be the length of the shortest closed path connecting {X1, X2,..., Xn}. It is proved that there is a constant 0
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom