By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Du, D.Z. ; Dept. of Comput. Sci., Princeton Univ., NJ, USA ; Hwang, F.K.

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)

Published in:

Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on

Date of Conference:

22-24 Oct 1990