Steiner Minimal Trees

Gilbert, E. N., & Pollak, H. O. (1968). Steiner Minimal Trees. SIAM Journal on Applied Mathematics.

Type

Journal article

Intellectual base

Primary research

Year

1968

DOI

10.1137/0116001

DOI registrant

Society for Industrial & Applied Mathematics

Link

https://doi.org/10.1137/0116001

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Domain-specific

• Gilbert–Pollak conjecture
  • The Gilbert–Pollak statement bounds the Steiner ratio by asserting MST length divided by Steiner-tree length is at most two over square root three.

Mechanisms

• Corridor Seeding or Repeater Placement
  • Two well-sited midpoints open the entire drainage — a classic move where adding relay points connects endpoints far more cheaply than any direct route could.

    This sourceShows that adding intermediate Steiner points can produce a shorter network connecting the required endpoints than an endpoint-only tree.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:207a35273084 · see in the full table