Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    A proof of the Gilbert-Pollak conjecture on the Steiner ratio (1992)
    Springer
    Algorithmica 7 (1992), S. 121-135 
    Details
    ISSN: 1432-0541
    Keywords: Steiner trees ; Spanning trees ; Steiner ratio ; Convexity ; Hexagonal trees
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract LetP be a set ofn points on the euclidean plane. LetL s(P) andL m (P) denote the lengths of the Steiner minimum tree and the minimum spanning tree onP, respectively. In 1968, Gilbert and Pollak conjectured that for anyP,L s (P)≥(√3/2)L m (P). We provide a proof for their conjecture in this paper.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01758755
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...