Lawler; E. L. (Minimum TSP The Traveling-Salesman Problem)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O({1.674}^V E^{2})$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1985

Reference

https://onlinelibrary-wiley-com.ezproxy.canberra.edu.au/doi/10.1002/net.3230180309

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Lawler;_E._L._(Minimum_TSP_The_Traveling-Salesman_Problem)&oldid=45417"