Spanning trees with many leaves
SIAM Journal on Discrete Mathematics
Spanning trees in graphs of minimum degree 4 or 5
Discrete Mathematics
On the approximability of some maximum spanning tree problems
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Approximating maximum leaf spanning trees in almost linear time
Journal of 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 Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A greedy approximation for minimum connected dominating sets
Theoretical Computer Science
Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
SIAM Journal on Discrete Mathematics
A 5/3-approximation for finding spanning trees with many leaves in cubic graphs
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Spanning trees with many leaves in graphs without diamonds and blossoms
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
An approximation algorithm for the maximum leaf spanning arborescence problem
ACM Transactions on Algorithms (TALG)
Solving connected dominating set faster than 2n
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
An Amortized Search Tree Analysis for k-Leaf Spanning Tree
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Max-leaves spanning tree is APX-hard for cubic graphs
Journal of Discrete Algorithms
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem
Journal of Discrete Algorithms
| Hi-index | 0.00 |
We consider the problem of finding a spanning tree that maximizes the number of leaves (MaxLeaf ). We provide a 3/2-approximation algorithm for this problem when restricted to cubic graphs, improving on the previous 5/3-approximation for this class. To obtain this approximation we define a graph parameter x(G ), and construct a tree with at least (n *** x(G ) + 4)/3 leaves, and prove that no tree with more than (n *** x(G ) + 2)/2 leaves exists. In contrast to previous approximation algorithms for MaxLeaf , our algorithm works with connected dominating sets instead of constructing a tree directly. The algorithm also yields a 4/3-approximation for Minimum Connected Dominating Set in cubic graphs.