• DocumentCode
    2776247
  • Title

    An approach for proving lower bounds: solution of Gilbert-Pollak´s conjecture on Steiner ratio

  • Author

    Du, D.Z. ; Hwang, F.K.

  • Author_Institution
    Dept. of Comput. Sci., Princeton Univ., NJ, USA
  • fYear
    1990
  • fDate
    22-24 Oct 1990
  • Firstpage
    76
  • Abstract
    A family of finitely many continuous functions on a polytope X , namely {gi(x)}i∈I, is considered, and the problem of minimizing the function f(x)=maxi∈Igi( x) on X is treated. It is shown that if every g i(x) is a concave function, then the minimum value of f(x) is achieved at finitely many special points in X. As an application, a long-standing problem about Steiner minimum trees and minimum spanning trees is solved. In particular, if P is a set of n points on the Euclidean plane and Ls(P) and Lm( P) denote the lengths of a Steiner minimum tree and a minimum spanning tree on P, respectively, it is proved that, for any P, LS(P)⩾√3L m(P)/2, as conjectured by E.N. Gilbert and H.O. Pollak (1968)
  • Keywords
    minimisation; trees (mathematics); Euclidean plane; Steiner minimum trees; Steiner ratio; concave function; continuous functions; function minimization; lower bounds; minimum spanning trees; polytope; Computer science; Laboratories; Mathematics; Minimax techniques; NP-hard problem; Q measurement; Steiner trees;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
  • Conference_Location
    St. Louis, MO
  • Print_ISBN
    0-8186-2082-X
  • Type

    conf

  • DOI
    10.1109/FSCS.1990.89526
  • Filename
    89526