A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks

Saved in:
Bibliographic Details
Published in:Journal of Combinatorial Optimization Vol. 25; pp. 430 - 459
Main Authors: Kamei, Sayaka, Kakugawa, Hirostugu, Devismes, Stéphane, Tixeuil, Sébastien
Format: Journal Article
Language:Japanese
Published: Springer Berlin Heidelberg 01.01.2010
Subjects:
[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
[INFO.INFO-DC]Computer Science [cs]/Distributed
[INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing
[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]
[INFO]Computer Science [cs]
and Cluster Computing [cs.DC]
Applied Mathematics
Approximation
Computational Theory and Mathematics
Computer Science Applications
Control and Optimization
Discrete Mathematics and Combinatorics
Fault-tolerance
Maximum leaf spanning tree
Parallel
Self-stabilization
ISSN:1382-6905, 1573-2886
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
ISSN:1382-6905
1573-2886
DOI:10.1007/978-3-642-14031-0_11