15 citations · 15 across the 8 of their papers we have counts for
Showing 2001Show all
3 papers · 1 filter
math.CO2001
The Floyd-Warshall Algorithm, the AP and the TSP, Part II
Howard Kleiman
In math.CO/0111309, we used admissible permutations and a variant of the Floyd-Warshall Algorithm to obtain an optimal solution to the Assignment Problem and an approximate solutio…
math.CO2001
The Floyd-Warshall Algorithm, the AP and the TSP
Howard Kleiman
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…
math.CO2001
On an Algorithm of Frieze
Howard Kleiman
The algorithm reduces the running time of an algorithm of Frieze from O(n^{1.5)) to O(n^(4/3 + o)). It also introduces the concept of admissible permutations that is used in algori…