Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. T. Fomenko (1989)
The Plateau Problem
L. A. Lyusternik, L. G. Shnirelman (1930)
Proc. Trudy Math. Mech. Inst. I MGU
W. D. Smith (1992)
How to find Steiner minimal trees in Euclidean d-spaceAlgorithmica, 7
A. O. Ivanov, A. A. Tuzhilin (1994)
Some problems concerning minimal networksInternat. J. Shape Modeling, 1
F. Morgan, J. Hass (1996)
Geodesic nets on the 2-sphereProc. Amer. Math. Soc., 124
J. B. Kruskal (1956)
On the shortest spanning subtree of a graph and traveling salesman problemProc. Amer. Math. Soc., 7
M. Hanan (1966)
On Steiner's problem with rectilinear distanceSIAM J. Appl. Math., 14
A. Heppes (1964)
Isogonal spherischen NetzeAnn. Univ. Sci., Budapest, Sect. Math., 7
M. Deza, M. I. Shtogrin (1999)
Infinite polycycles and helicinesUspekhi Mat. Nauk, 54
D. Z. Du, F. K. Hwang, S. C. Chao (1985)
Steiner minimal trees for points on a circleProc. Amer. Math. Soc., 95
R. L. Francis (1963)
A note on the optimum location of new machines in existing plant layoutsJ. Indust. Engrg., 14
M. Besson, A. Tromba (1984)
The cusp catastrophe of Thom in bifurcation of minimal surfacesManuscripta Math., 46
I. V. Ptitsina (1995)
Classification of closed local minimal networks on flat Klein bottlesVestnik MGU, ser. Mat., 2
A. O. Ivanov, A. A. Tuzhilin (1997)
Geometry of the set of minimal networks with a given topology and a fixed boundaryIzv. Ross. Akad. Nauk, 61
E. W. Dijkstra (1959)
A note on two problems with connection with graphsNumer. Math., 1
G. A. Galperin (1991)
On Lyusternik-Shnirelman theorem for polyhedraUspekhi Mat. Nauk, 46
Z. A. Melzak (1960)
On the problem of SteinerCanad. Math. Bull., 4
M. M. Postnikov (1971)
Introduction to Morse Theory
D. S. Richards, J. S. Salowe (1992)
A linear-time algorithm to construct a rectilinear Steiner minimal tree for k-extremal point setsAlgorithmica, 7
D. Z. Du, F. K. Hwang, G. D. Song, G. T. Ting (1987)
Steiner minimal trees on sets of four pointsDiscrete Comput. Geom., 2
F. Preparata, M. Shamos (1985)
Computational Geometry. An Introduction
A. A. Tuzhilin (1996)
Complete classification of local binary trees with regular boundaries. The case of skeletonsFundamentalnaya i prikladnaya matematika, 2
A. L. Edmonds, J. H. Ewing, R. S. Kulkarni (1982)
Regular tessellations of surfaces and p, q, 2,-triangle groupsAnn. Math., 166
T. Dao Chong, A. T. Fomenko (1991)
Minimal Surfaces and Plateau Problem
M. M. Postnikov (1987)
Lectures on Geometry. Term III. Smooth Manifolds
J. H. Rubinstein, J. F. Weng (1997)
Compression theorems and Steiner ratios on spheresJ. Combin. Optim., 1
D. Z. Du, F. K. Hwang, J. F. Weng (1983)
Steiner minimal trees for points on a zig-zag linesTrans. Amer. Math. Soc., 278
D. Z. Du, F. K. Hwang, J. F. Weng (1987)
Steiner minimal trees for regular polygonsDiscrete Comput. Geom., 2
F. K. Hwang (1986)
A linear time algorithm for full Steiner treesOper. Res. Lett., 5
A. O. Ivanov, A. A. Tuzhilin (1991)
The Steiner problem for convex boundaries or flat minimal networksMat. Sb., 182
V. S. Mikhalevich, V. A. Trubin, N. Z. Shor (1986)
Optimization Problems in Industrial Planning: Models, Methods, Algorithms
D. Z. Du, F. K. Hwang, E. N. Yao (1985)
The Steiner ratio conjecture is true for five pointsJ. Combin. Theory Ser. A, 38
M. R. Garey, D. S. Johnson (1977)
The rectilinear Steiner problem is N P-completeSIAM J. Appl. Math., 32
A. O. Ivanov, A. A. Tuzhilin (1996)
“Classification of minimal skeletons with regular boundaries”Uspekhi Mat. Nauk, 51
V. L. Höng (1989)
Minimal Φ-Lagrangian surfaces in almost Hermitian manifoldsMat. Sb., 180
H. O. Pollak (1978)
Some remarks on the Steiner problemJ. Combin. Theory, Ser. A, 24
A. O. Ivanov, A. A. Tuzhilin (1996)
Twisting number of planar linear treesMat. Sb., 187
D. Z. Du, F. K. Hwang (1983)
A new bound for the Steiner ratioTrans. Amer. Math. Soc., 278
A. O. Ivanov, A. A. Tuzhilin (1999)
Branching Geodesics. Geometrical Theory of Local Minimal Networks
A. O. Ivanov, A. A. Tuzhilin (1995)
Weighted minimal 2-treesUspekhi Mat. Nauk, 50
G. Georgakopoulos, C. H. Papadimitriou (1987)
The 1-Steiner problemJ. Algorithm, 8
G. Lawlor, F. Morgan (1994)
Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other normsPacific J. Math., 166
S. Hildebrandt, A. Tromba (1996)
The Parsimonious Universe
A. O. Ivanov, A. A. Tuzhilin (1996)
Geometry of planar linear treesUspekhi Mat. Nauk, 51
A. A. Tuzhilin, A. T. Fomenko (1992)
Elements of Geometry and Topology of Minimal Surfaces in Three-Dimensional Space
M. Deza, M. I. Shtogrin (2000)
Infinite primitive polycyclesUspekhi Mat. Nauk, 55
O. Ore (1962)
Theory of Graphs
A. A. Tuzhilin (1996)
Minimal binary trees with regular boundary: the case of 4-ends skeletonsMat. Sb., 187
A. S. Mishenko, A. T. Fomenko (1980)
Lectures on Differential Geometry and Topology
A. O. Ivanov, A. A. Tuzhilin (1999)
Geometry of convex polygons and locally minimal binary trees spanning these polygonsMat. Sb., 190
A. O. Ivanov (1996)
Planar weighted minimal binary treesFundamental'naya i prikladnaya matem., 2
A. O. Ivanov, A. A. Tuzhilin (1993)
The Steiner problem for convex boundaries, I; IIAdvances in Soviet Math., 15
A. O. Ivanov, A. A. Tuzhilin (1997)
Geometry and topology of local minimal 2-treesBol. Soc. Bras. Mat., 28
J. Milnor (1963)
Morse Theory
A. O. Ivanov (1995)
Geometry of planar local minimal binary treesMat. Sb., 186
G. Lawlor, F. Morgan (1991)
Computing Optimal Geometries
V. Jarnik, M. Kössler (1934)
O minimalnich grafeth obeahujicich n danijch boduCas. Pest. Mat. Fys., 63
A. T. Fomenko, D. B. Fuchs (1989)
Course of Homotopic Topology
D. Z. Du (1989)
On Steiner Ratio Conjectures
M. Brazil, J. Cole, J. H. Rubinstein, A. D. Thomas, J. F. Weng, N. C. Wormald (1995)
Full minimal Steiner trees on lattice sets
V. A. Emelichev (1990)
Lectures on Graph Theory
F. R. K. Chung, M. Gardner, R. L. Graham (1989)
Steiner trees on a checkerboardMath. Magazine, 62
B. A. Dubrovin, A. T. Fomenko, S. P. Novikov (1986)
Modern Geometry
Guidance -GAAP to Non-GAAP Reconciliation Gross Margin Rate Operating Margin Rate Earnings per Share GAAP 57
A. V. Pogorelov (1949)
Quasigeodesic lines on convex surfacesMat. Sb., 25
R. C. Clark (1981)
Communication networks, soap films and vectorsPhys. Ed., 16
A. D. Alexandrov (1948)
Interior Geometry of Convex Surfaces
J. H. Rubinstein, D. A. Thomas (1991)
A variational approach to the Steiner network problemAnn. Oper. Res., 33
A. T. Fomenko (1990)
Variational Problems in Topology
D. Cieslik (1998)
Using Hadwiger Numbers in Networks Design
Estimated Adjustments for: Amortization of Product Intangibles 2
E. N. Gilbert, H. O. Pollak (1968)
Steiner minimal treesSIAM J. Appl. Math., 16
F. K. Hwang, D. Richards, P. Winter (1992)
The Steiners Tree Problem
A. O. Ivanov, A. A. Tuzhilin (1992)
Geometry of minimal networks and one-dimensional Plateau problemUspekhi Mat. Nauk, 47
I. V. Ptitsina (1994)
Classification of closed local minimal networks on tetrahedraMat. Sb., 185
F. K. Hwang, J. F. Weng (1986)
Hexagonal coordinate systems and Steiner minimal treesDiscrete Math., 62
A. A. Tuzhilin (1991)
Morse type indices of minimal surfaces in ℝ3 and ℍ3Izv. AN SSSR, 3
A. O. Ivanov, A. A. Tuzhilin (1990)
Solution of Steiner problem for convex boundariesUspekhi Mat. Nauk, 45
P. M. Gruber (1993)
Assimptotic estimates for best and stepwise approximation of convex bodies, I; II; III (with Glasauer, S.)Forum Math., 59
P. M. Gruber (1991)
The Victor Klee Festschrift
F. K. Hwang (1976)
On Steiner minimal trees with rectilinear distanceSIAM J. Appl. Math., 30
R. C. Prim (1957)
Shortest connecting networks and some generalizationsBSTJ, 36
F. R. K. Chung, R. L. Graham (1978)
Steiner trees for laddersAnn. Discrete Math., 2
D. Gromoll, W. Klingenberg, W. Meyer (1968)
Riemannsche Geometrie im Groβen
W. Klingenberg (1978)
Lectures on Closed Geodesics
A. O. Ivanov, I. V. Ptitsina, A. A. Tuzhilin (1992)
Classification of closed minimal networks on flat toriMat. Sb., 183
A. Gray (1990)
Tubes
A. O. Ivanov, A. A. Tuzhilin (1994)
Minimal Networks. The Steiner Problem and Its Generalizations
E. J. Cockayne (1967)
On the Steiner problemCanad. J. Math., 10
Z. A. Melzak (1973)
Companion to Concrete Mathematics
M. Brazil, J. H. Rubinstein, A. D. Thomas, J. F. Weng, N. C. Wormald (1995)
Minimal Steiner trees for rectangular arrays of lattice points
A. O. Ivanov, A. A. Tuzhilin (1999)
The space of mutually parallel linear networks with a fixed boundaryIzv. Ross. Akad. Nauk, 63
M. Brazil, J. H. Rubinstein, A. D. Thomas, J. F. Weng, N. C. Wormald (1995)
Minimal Steiner trees for generalized checkerboards
D. Cieslik (1998)
The Steiner ratio of metric spaces
V. L. Höng (1990)
Relative calibration and the problem of stability of minimal surfaces
I. V. Shklyanko (1989)
One-dimensional plateau problem on surfacesVestnik MGU, ser. Mat., 3
A. O. Ivanov (1993)
Calibration forms and new examples of globally minimal surfaces
J. H. Rubinstein, D. A. Thomas (1989)
The Steiner ratio conjecture for six pointsJ. Combin. Theory Ser. A, 58
This paper is supposed to be a review on the new branch of mathematics – extreme networks theory that appeared at the crossroad of differential geometry, variational calculus and discrete mathematics. One of the starting points of the theory is the geometrical approach to the Steiner problem. The authors have selected the most impressive results of the theory demonstrating a new approach, new effects, and new constructions appearing in this context. One of the main aims of the paper is to attract the attention of the specialist from similar fields to this new and rapidly developing theory.
Acta Applicandae Mathematicae – Springer Journals
Published: Oct 19, 2004
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.