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

Authors:
Sayaka Kamei;Hirotsugu Kakugawa;Stéphane Devismes;Sébastien Tixeuil
Affiliations:
Dept. of Information Engineering, Hiroshima University, Japan;Dept. of Computer Science, Osaka University, Japan;Université Joseph Fourier, Grenoble I, France;LIP6 UMR, Université Pierre et Marie Curie, France
Venue:
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Year:
2010

Citing 11
Cited 0

A short note on the approximability of the maximum leaves spanning tree problem

Information Processing Letters
Approximating maximum leaf spanning trees in almost linear time

Journal of Algorithms
Self-stabilization

Self-stabilization
A Uniform Self-Stabilizing Minimum Diameter Tree Algorithm (Extended Abstract)

WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Approximation Algorithms for Connected Dominating Sets

Algorithmica
Self-Stabilizing Leader Election in Optimal Space

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing minimum-degree spanning tree within one from the optimal degree

IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
A self-stabilizing distributed algorithm for minimum connected dominating sets in wireless sensor networks with different transmission ranges

ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
A new self-stabilizing minimum spanning tree construction with loop-free property

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Self-stabilizing algorithms

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

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 on arbitrary topology networks. Our algorithm is the first self-stabilizing protocol that is specifically designed for the construction of anMLST. It improves other previous self-stabilizing solutions both for generality (arbitrary topology graphs vs. unit disk graphs or generalized disk graphs, respectively) and for approximation ratio, as it guarantees the number of its leaves is at least 1/3 of the maximum one. The time complexity of our algorithm is O(n2) rounds.