Access the full text.
Sign up today, get DeepDyve free for 14 days.
Z. Melzak (1961)
On the Problem of SteinerCanadian Mathematical Bulletin, 4
G. Pólya (1954)
Induction and Analogy in Mathematics
J. Soukup (1969)
A method for finding the roots of a polynomialNumerische Mathematik, 13
E. Gilbert (1967)
Minimum cost communication networksBell System Technical Journal, 46
(1976)
Steiner points and the roots of a polynomial, presentation at the Working Group on Networks
Shi-Kuo Chang (1972)
The Generation of Minimal Trees with a Steiner TopologyJ. ACM, 19
J. Soukup, W. Chow (1973)
Set of test problems for the minimum length connection networks
(1972)
The generation of Minimal Steiner Trees with a Steiner Topology
J. Soukup (1975)
On Minimum Cost Networks with Nonlinear CostsSiam Journal on Applied Mathematics, 29
(1976)
Steiner points and the roots of a polynomial, presentation at the Working Group on
W. Miehle (1958)
Link-Length Minimization in NetworksOperations Research, 6
E. Cockayne (1969)
Computation of minimal length full Steiner trees on the vertices of a convex polygonMathematics of Computation, 23
Physical Analog Model of Optimum Mine Processing Plant Location, internal report
The paper is a collection of observations and ideas on a surprising similarity between Steiner points on one hand, and roots of a complex polynomial on the other. These ideas can also be used to derive a simple practical method to generate good suboptimal Steiner trees. However, the main purpose of the paper is to point out a vast area of problems still open to further research.
ACM SIGMAP Bulletin – Association for Computing Machinery
Published: Dec 1, 1977
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.