Outside-In algorithm (Turnpike Problem Turnpike Problem)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O({2}^n nlogn)$

Space Complexity

$O(n)$ words

(Seems like this just needs to keep track of current configuration being tested)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1991

Reference

NA