TSPLIB (Minimum TSP The Traveling-Salesman Problem)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O({2}^V \log E)$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1991

Reference

https://pubsonline.informs.org/doi/abs/10.1287/ijoc.3.4.376