Indexed metadata
The Complexity of Computing Steiner Minimal Trees
M. R. Garey, R. L. Graham, D. S. Johnson
Source abstract
It is shown that the problem of computing Steiner minimal trees for general planar point sets is inherently at least as difficult as any of the -complete problems (a well known class of computationally intractable problems). This effectively destroys any hope for finding an efficient algorithm for this problem.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.