Turnpike Problem: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Turnpike Problem (Turnpike Problem)}} == Description == Given $n$ points and $\binom{n}{2}$ distances, find each distance's corresponding pair of points. == Parameters == <pre>n: number of points</pre> == Table of Algorithms == {| class="wikitable sortable" style="text-align:center;" width="100%" ! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference |- | Outside-In algorithm (Turnpike Problem Turnpike Problem)|Outside-...") |
No edit summary |
||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
n: number of points | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 12:03, 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 Decades graph
