The Steiner ratio conjecture for cocircular points

6Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A Steiner minimal tree S is a network of shortest possible length connecting a set of n points in the plane. Let T be a shortest tree connecting the n points but with vertices only at these points. T is called a minimal spanning tree. The Steiner ratio conjecture is that the length of S divided by the length of T is at least √3/2. In this paper we use a variational approach to show that if the n points lie on a circle, then the Steiner ratio conjecture holds. © 1992 Springer-Verlag New York Inc.

Cite

CITATION STYLE

APA

Rubinstein, J. H., & Thomas, D. A. (1992). The Steiner ratio conjecture for cocircular points. Discrete & Computational Geometry, 7(1), 77–86. https://doi.org/10.1007/BF02187826

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free