IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v47y2000i2p125-128.html
   My bibliography  Save this article

Estimating the asymptotic constants of the total length of Euclidean minimal spanning trees with power-weighted edges

Author

Listed:
  • Cortina-Borja, Mario
  • Robinson, Tony

Abstract

Steele (1988, Ann. Probab. 16, 1767-1787) and Aldous and Steele (1992, Probab. Theory Related Fields 92, 247-258) have proved that the total length of several combinatorial optimization problems in involving trees with n nodes and [alpha]-power-weighted edges is asymptotically c(p,[alpha])n(p-[alpha])/p, where 0

Suggested Citation

  • Cortina-Borja, Mario & Robinson, Tony, 2000. "Estimating the asymptotic constants of the total length of Euclidean minimal spanning trees with power-weighted edges," Statistics & Probability Letters, Elsevier, vol. 47(2), pages 125-128, April.
    • Handle: RePEc:eee:stapro:v:47:y:2000:i:2:p:125-128
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(99)00147-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Petar Jevtić & J. Michael Steele, 2015. "Euclidean Networks with a Backbone and a Limit Theorem for Minimum Spanning Caterpillars," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 992-1004, October.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:47:y:2000:i:2:p:125-128. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.