Spanning trees with many leaves
SIAM Journal on Discrete Mathematics
Spanning trees in graphs of minimum degree 4 or 5
Discrete Mathematics
A short note on the approximability of the maximum leaves spanning tree problem
Information Processing Letters
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Approximating maximum leaf spanning trees in almost linear time
Journal of Algorithms
Some APX-completeness results for cubic graphs
Theoretical Computer Science
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
Solving Connected Dominating Set Faster than 2 n
Algorithmica - Parameterized and Exact Algorithms
Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Graph-Theoretic Concepts in Computer Science
On Finding Directed Trees with Many Leaves
Parameterized and Exact Computation
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)
A New Algorithm for Finding Trees with Many Leaves
Algorithmica
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
We consider the problem of finding a spanning tree with maximum number of leaves. A 2-approximation algorithm is known for this problem, and a 3/2-approximation algorithm when restricted to graphs where every vertex has degree 3 (cubic graphs). The problem is known to be APX-hard in general, and NP-hard for cubic graphs. We show that it is also APX-hard for cubic graphs. The APX-hardness of the related problem Minimum Connected Dominating Set for cubic graphs follows.