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 |
||
| (4 intermediate revisions by the same user not shown) | |||
| Line 6: | Line 6: | ||
== Parameters == | == Parameters == | ||
$n$: number of points | |||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 20: | Line 20: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Turnpike Problem - Time.png|1000px]] | [[File:Turnpike Problem - Time.png|1000px]] | ||
== References/Citation == | == References/Citation == | ||
http://hariharan-ramesh.com/ppts/turnpike.pdf | http://hariharan-ramesh.com/ppts/turnpike.pdf | ||
Latest revision as of 09:12, 28 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
