A tight lower bound for the Steiner ratio in Minkowski planes

@article{Gao1995ATL,
  title={A tight lower bound for the Steiner ratio in Minkowski planes},
  author={Biao Gao and Dingzhu Du and Ronald L. Graham},
  journal={Discrete Mathematics},
  year={1995},
  volume={142},
  pages={49-63}
}
A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimum possible total length. The Steiner ratio for a metric space is the largest lower bound for the ratio of lengths between a minimum Steiner tree and a minimum spanning tree on the same set of points in the metric space. In this note, we show that for any Minkowski plane, the Steiner ratio is at least 2/3. This settles a conjecture of Cieslik (1990) and also Du et al. (1991). 
5 Citations
16 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-5 of 5 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 16 references

The Steiner ratio of Banach-Minkowski planes

  • D. Cieslik
  • Contemporary Methods in Graph Theory (BI…
  • 1990
Highly Influential
3 Excerpts

Paired calibrations applied to soapfilms, immiscible fluids, and surfaces or networks minimizing other norms

  • G. Lawlor, F. Morgan
  • Pacific J. Math
  • 1994

The structure of singularities of @minimizing networks in Hz ,

  • L. Kuklinski, K. von Haam
  • Pacific J . Math .
  • 1991

On the Steiner problem , Canad

  • R. Bodendiek
  • Contemporary Methods in Graph Theory
  • 1990

Ghandehari, The Fermat problem in Minkowski space

  • M.A.G.D. Chakerian
  • Geom. Dedicata
  • 1985

Similar Papers

Loading similar papers…