17
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

An upper bound for the average length of the euclidean minimum spanning tree

&
Pages 1-12 | Received 26 Apr 1988, Accepted 06 May 1988, Published online: 19 Mar 2007

References

  • Beardwood , J.H.H. , Halton , J.H. and Hammersley , J.M. 1959 . The shortest path through many points . Proc. Cambridge Phil. Soc , 55 : 229 – 327 .
  • Marks , E.S. 1948 . A lower bound for the expected travel among m random points . Ann. Math. Statistics , 19 : 419 – 422 .
  • Meyer , Paul L. 1970 . Introductory Probability and Statistical Applications , Reading, MA : Addison-Wesley .
  • Supowit , K. , Reingold , E.M. and Plasted , D.A. 1983 . The traveling salesman problem and minimum matching in the unit square . SIAM J. Comput , 12 ( 1 ) : 144 – 156 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.