Mathematicians learn how to join the dots

Sangalli, Arturo
April 1991
New Scientist;4/20/91, Vol. 130 Issue 1765, p22
Reports on mathematicians, Ding-Zhu Du and Frank Hwang's solution to an optimization problem, known as the Steiner ratio conjecture. Background on the Steiner minimum tree (SMT); Problem of finding an SMT; Minimum spanning tree (MST) solution; Comparison between SMT and MST solutions; Transformation of the Steiner ratio conjecture into a minimax problem.


Related Articles

  • Theory of Computational Complexity. Zilinskas, A. // Interfaces;May/Jun2002, Vol. 32 Issue 3, p93 

    Reviews the book "Theory of Computational Complexity," by Ding-Zhu Du and Ker-I Ko.

  • Book Reviews. Welsh, Dominic // Bulletin of the London Mathematical Society;Jun2001, Vol. 33 Issue 3, p377 

    No abstract available.

  • Heuristics, LPs, and trees on trees: Network design analyses. Balakrishnan, Anantaram; Magnanti, Thomas I. // Operations Research;May/Jun96, Vol. 44 Issue 3, p478 

    We study a class of models, known as overlay optimization problems, composed of "base" and "overlay" subproblems, linked by the requirement that the overlay solution be contained in the base solution. In some telecommunication settings, a feasible base solution is a spanning tree, and the...

  • Cores of Geometric Graphs. Godsil, Chris; Royle, Gordon // Annals of Combinatorics;Jun2011, Vol. 15 Issue 2, p267 

    Cameron and Kazanidis have recently shown that rank-three graphs are either cores or have complete cores, and they asked whether this holds for all strongly regular graphs. We prove that this is true for the point graphs and line graphs of generalized quadrangles and that when the number of...

  • On the Intersection Problem for Steiner Triple Systems of Different Orders. Danziger, Peter; Dukes, Peter; Griggs, Terry; Mendelsohn, Eric // Graphs & Combinatorics;Sep2006, Vol. 22 Issue 3, p311 

    A Steiner triple system of order v, or STS( v), is a pair ( V, [InlineMediaObject not available: see fulltext.]) with V a set of v points and [InlineMediaObject not available: see fulltext.] a set of 3-subsets of V called blocks or triples, such that every pair of distinct elements of V occurs...

  • The Steiner Problem in Graphs: Topological Methods of Solution. Panyukov, A. V. // Automation & Remote Control;Mar2004, Vol. 65 Issue 3, p439 

    Algorithms for the Steiner problem and its generalizations on large graphs with a relatively small number of terminal vertices are designed by a two-level solution scheme: a network topology (i.e., a tree determining the adjacency of terminal vertices and branching points) is determined in the...

  • AN ELECTROMAGNETISM-LIKE METHOD FOR THE MAXIMUM SET SPLITTING PROBLEM. KRATICA, Jozef // Yugoslav Journal of Operations Research;2013, Vol. 23 Issue 1, p31 

    In this paper, an electromagnetism-like approach (EM) for solving the maximum set splitting problem (MSSP) is applied. Hybrid approach consisting of the movement based on the attraction-repulsion mechanisms combined with the proposed scaling technique directs EM to promising search regions. Fast...

  • POLYNOMIALLY SOLVABLE SPECIAL CASES OF THE STEINER PROBLEM IN PLANAR NETWORKS. Bern, Marshall; Bienstock, Daniel // Annals of Operations Research;1991, Vol. 33 Issue 1-4, p405 

    We give polynomial-time algorithms for two special cases of the Steiner problem: (1) the underlying network is planar and all terminals lie within a bounded number of ‘layers’ of a single face, and (2) the problem is the rectilinear Steiner problem and the number of rectilinear...

  • THE STEINER RATIO FOR FIVE POINTS. Booth, R. S. // Annals of Operations Research;1991, Vol. 33 Issue 1-4, p419 

    It was conjectured by Gilbert and Pollak [5] that for any finite set of points in the Euclidean plane, the ratio of the length of a Steiner minimal tree to the length of a minimal spanning tree is at least √3/2. The present paper proves the conjecture for five points, using a formula for...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics