Turnpike Problem: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 20: | Line 20: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Turnpike Problem - Time.png|1000px]] | [[File:Turnpike Problem - Time.png|1000px]] | ||
== Space Complexity | == Space Complexity Graph == | ||
[[File:Turnpike Problem - Space.png|1000px]] | [[File:Turnpike Problem - Space.png|1000px]] | ||
== Pareto | == Pareto Frontier Improvements Graph == | ||
[[File:Turnpike Problem - Pareto Frontier.png|1000px]] | [[File:Turnpike Problem - Pareto Frontier.png|1000px]] | ||
Revision as of 14:05, 15 February 2023
Description
Given $n$ points and $\binom{n}{2}$ distances, find each distance's corresponding pair of points.
Parameters
n: number of points
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Outside-In algorithm | 1991 | $O({2}^n nlogn)$ | $O(n)$ | Exact | Deterministic |
Time Complexity Graph
Space Complexity Graph
Pareto Frontier Improvements Graph
