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

DOI10.1007/978-3-642-14031-0_11zbMath1286.68501OpenAlexW1547111886MaRDI QIDQ3578305

Sébastien Tixeuil, Stéphane Devismes, Hirotsugu Kakugawa, Sayaka Kamei

Publication date: 20 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14031-0_11

Mathematics Subject Classification ID

Approximation algorithms (68W25) Distributed algorithms (68W15)

This page was built for publication: A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks