Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Frisch, H. L.
and
Hammersley, J. M.
1963.
Percolation Processes and Related Topics.
Journal of the Society for Industrial and Applied Mathematics,
Vol. 11,
Issue. 4,
p.
894.
Hanan, M.
1966.
On Steiner’s Problem with Rectilinear Distance.
SIAM Journal on Applied Mathematics,
Vol. 14,
Issue. 2,
p.
255.
Gilbert, E. N.
1967.
Minimum cost communication networks.
The Bell System Technical Journal,
Vol. 46,
Issue. 9,
p.
2209.
Cockayne, E. J.
1967.
On the Steiner Problem.
Canadian Mathematical Bulletin,
Vol. 10,
Issue. 3,
p.
431.
Gilbert, E. N.
and
Pollak, H. O.
1968.
Steiner Minimal Trees.
SIAM Journal on Applied Mathematics,
Vol. 16,
Issue. 1,
p.
1.
DeMar, Richard F.
1968.
The Problem of the Shortest Network Joining n Points.
Mathematics Magazine,
Vol. 41,
Issue. 5,
p.
225.
Cockayne, E. J.
and
Melzak, Z. A.
1968.
Steiner’s problem for set-terminals.
Quarterly of Applied Mathematics,
Vol. 26,
Issue. 2,
p.
213.
Cockayne, E. J.
and
Melzak, Z. A.
1969.
Euclidean Constructibility in Graph-Minimization Problems.
Mathematics Magazine,
Vol. 42,
Issue. 4,
p.
206.
Cockayne, E. J.
1969.
Computation of Galois group elements of a polynomial equation.
Mathematics of Computation,
Vol. 23,
Issue. 106,
p.
425.
Cockayne, E. J.
1969.
Computation of minimal length full Steiner trees on the vertices of a convex polygon.
Mathematics of Computation,
Vol. 23,
Issue. 107,
p.
521.
Cockayne, E. J.
1970.
On the Efficiency of the Algorithm for Steiner Minimal Trees.
SIAM Journal on Applied Mathematics,
Vol. 18,
Issue. 1,
p.
150.
Hakimi, S. L.
1971.
Steiner's problem in graphs and its implications.
Networks,
Vol. 1,
Issue. 2,
p.
113.
Chang, Shi-Kuo
1972.
The Generation of Minimal Trees with a Steiner Topology.
Journal of the ACM,
Vol. 19,
Issue. 4,
p.
699.
Cockayne, E. J.
1972.
On Fermat's Problem on the Surface of a Sphere.
Mathematics Magazine,
Vol. 45,
Issue. 4,
p.
216.
Nastansky, L.
Selkow, S. M.
and
Stewart, N. F.
1974.
Cost-minimal trees in directed acyclic graphs.
Zeitschrift für Operations Research,
Vol. 18,
Issue. 1,
p.
59.
Soukup, J.
1975.
On Minimum Cost Networks with Nonlinear Costs.
SIAM Journal on Applied Mathematics,
Vol. 29,
Issue. 4,
p.
571.
Sankoff, David
and
Rousseau, Pascale
1975.
Locating the vertices of a steiner tree in an arbitrary metric space.
Mathematical Programming,
Vol. 9,
Issue. 1,
p.
240.
Lee, D. H.
1976.
Low cost drainage networks.
Networks,
Vol. 6,
Issue. 4,
p.
351.
Hwang, F. K.
1976.
On Steiner Minimal Trees with Rectilinear Distance.
SIAM Journal on Applied Mathematics,
Vol. 30,
Issue. 1,
p.
104.
van der Heyden, Will P. A.
1977.
Numerische Methoden bei Optimierungsaufgaben Band 3.
p.
79.