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

Sayaka Kamei (), Hirotsugu Kakugawa (), Stéphane Devismes () and Sébastien Tixeuil ()
Additional contact information
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

Journal of Combinatorial Optimization, 2013, vol. 25, issue 3, No 5, 430-459

Abstract: 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.

Keywords: Self-stabilization; Approximation; Maximum leaf spanning tree; Fault-tolerance (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9383-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:25:y:2013:i:3:d:10.1007_s10878-011-9383-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-011-9383-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().