| | |
| | |
Stat |
Members: 3645 Articles: 2'504'585 Articles rated: 2609
24 April 2024 |
|
| | | |
|
Article overview
| |
|
The Floyd-Warshall Algorithm, the AP and the TSP | Howard Kleiman
; | Date: |
30 Nov 2001 | Subject: | Combinatorics; Data Structures and Algorithms | math.CO cs.DS | 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. | Source: | arXiv, math.CO/0111309 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |