Skip to main content
SpringerLink
Log in

On greedy heuristics for steiner minimum trees

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We disprove a conjecture of Shor and Smith on a greedy heuristic for the Steiner minimum tree by showing that the length ratio between the Steiner minimum tree and the greedy tree constructed by their method for the same set of points can be arbitrarily close to√3/2. We also propose a new conjecture.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P. Berman and V. Ramaiye, An approximation algorithm for the Steiner tree problem,Journal of Algorithms,17 (1994), 381–408.

    Google Scholar 

  2. F. R. K. Chung and R. L. Graham, A new bound for Euclidean Steiner minimum trees,Annals of the New York Academy of Sciences,440 (1985), 328–346.

    Google Scholar 

  3. F. R. K. Chung and F. K. Hwang, A lower bound for the Steiner tree problem,SIAM Journal of Applied Mathematics,34 (1978), 27–36.

    Google Scholar 

  4. T. Cole, A problem in Steiner networks, Manuscript.

  5. D. Z. Du and F. K. Hwang, A new bound for the Steiner ratio,Transactions of the American Mathematical Society,278 (1983), 137–148.

    Google Scholar 

  6. D. Z. Du and F. K. Hwang, A proof of the Gilbert-Pollak conjecture on the Steiner ratio,Algorithmica,7 (1992), 121–135.

    Google Scholar 

  7. D. Z. Du, Y. Zhang, and Q. Feng, On better heuristic for Euclidean Steiner minimum trees,Proceedings of the and Symposium on the Foundations of Computer Science, 1991.

  8. M. R. Garey, R. L. Graham, and D. S. Johnson, The complexity of computing Steiner minimal trees,SIAM Journal of Applied Mathematics,32 (1977), 835–859.

    Google Scholar 

  9. E. N. Gilbert and H. O. Pollak, Steiner minimal trees,SIAM Journal of Applied Mathematics,16 (1968), 1–29.

    Google Scholar 

  10. R. L. Graham and F. K. Hwang, Remarks on Steiner minimal trees,Bulletin of the Institute of Mathematics, Academia Sinica,4 (1976), 177–182.

    Google Scholar 

  11. H. O. Pollak, Some remarks on the Steiner problem,Journal of Combinatorial Theory, Series A,24 (1978), 278–295.

    Google Scholar 

  12. J. H. Rubinstein and D. A. Thomas, The Steiner ratio conjecture for six points,Journal of Combinatorial Theory, Series A,58 (1991), 54–77.

    Google Scholar 

  13. J. H. Rubinstein and D. A. Thomas, The calculus of variations and the Steiner problem,Annals of Operations Research,33 (1991), 481–499.

    Google Scholar 

  14. W. D. Smith and P. W. Shor, Steiner tree problems,Algorithmica,7 (1992), 329–332.

    Google Scholar 

  15. Hong Yi, Yang Hongcang, and Du Dingzhu, An inequality for convex functions,Kexue Tongbao 27 (1982), 901–904.

    Google Scholar 

  16. A. Z. Zelikovsky, The 11/6-approximation algorithm for the Steiner problem on networks,Algorithmica,9 (1993), 463–470.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Minnesota, 55455, Minneapolis, MN, USA

    Ding -Zhu Du

  2. Institute of Applied Mathematics, Chinese Academy of Sciences, 100080, Beijing, People's Republic of China

    Ding -Zhu Du

Authors
  1. Ding -Zhu Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by C. K. Wong.

Supported in part by the National Science Foundation under Grant CCR-9208913.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Du, D.Z. On greedy heuristics for steiner minimum trees. Algorithmica 13, 381–386 (1995). https://doi.org/10.1007/BF01293486

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01293486

Key words

Search

Navigation