Turnpike Problem: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
n: number of points | $n$: number of points | ||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 08:24, 10 April 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
Time-Space Tradeoff
