IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v25y2013i3d10.1007_s10878-011-9383-5.html
   My bibliography  Save this article

A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks

Author

Listed:
  • Sayaka Kamei

    (Graduate School of Engineering, Hiroshima University)

  • Hirotsugu Kakugawa

    (Osaka University)

  • Stéphane Devismes

    (Université Joseph Fourier)

  • Sébastien Tixeuil

    (UPMC Sorbonne Universités
    Institut Universitaire de France)

Abstract

The maximum leaf spanning tree (MLST) is a good candidate for constructing a virtual backbone in self-organized multihop wireless networks, but is practically intractable (NP-complete). Self-stabilization is a general technique that permits to recover from catastrophic transient failures in self-organized networks without human intervention. We propose a fully distributed self-stabilizing approximation algorithm for the MLST problem in arbitrary topology networks. Our algorithm is the first self-stabilizing protocol that is specifically designed to approximate an MLST. It builds a solution whose number of leaves is at least 1/3 of the maximum possible in arbitrary graphs. The time complexity of our algorithm is O(n 2) rounds.

Suggested Citation

  • Sayaka Kamei & Hirotsugu Kakugawa & Stéphane Devismes & Sébastien Tixeuil, 2013. "A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks," Journal of Combinatorial Optimization, Springer, vol. 25(3), pages 430-459, April.
    • Handle: RePEc:spr:jcomop:v:25:y:2013:i:3:d:10.1007_s10878-011-9383-5
    DOI: 10.1007/s10878-011-9383-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-011-9383-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-011-9383-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    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:spr:jcomop:v:25:y:2013:i:3:d:10.1007_s10878-011-9383-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.