The Floyd-Warshall Algorithm, the AP and the TSP
Combinatorics
2007-05-23 v1 Data Structures and Algorithms
Abstract
We use admissible permutations and a variant of the Floyd-Warshall algorithm to obtain an optimal solution to the Assignment Problem. Using another variant of the F-W algorithm, we obtain an approximate solution to the Traveling Salesman Problem. We also give a sufficient condition for the approximate solution to be an optimal solution.
Cite
@article{arxiv.math/0111309,
title = {The Floyd-Warshall Algorithm, the AP and the TSP},
author = {Howard Kleiman},
journal= {arXiv preprint arXiv:math/0111309},
year = {2007}
}
Comments
Text in Word 2000, math in MathType 4.0, sent in a PDF file written in Acrobat 5.0, 23 pages