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/doi/10.1002/net.3230180309