No label defined (Q4945792)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1424543
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1424543 |
Statements
23 March 2000
0 references
Steiner trees
0 references
shortest networker
0 references
0.8100110292434692
0 references
0.8100109696388245
0 references
0.8055880069732666
0 references
0.7872897386550903
0 references
The classical planar Steiner problem connects a given set of points in the plane by a network with smallest overall edge length. In this paper the authors consider the problem where two points and a straight line have to be connected. It is shown that the problem can be tackled by solving some quartic equation. It should be noted that this problem which may sound purely academic may have some applications in the designs of mines and irrigation systems. For the entire collection see [Zbl 0932.00010].
0 references
