Spanning trees with many leaves
SIAM Journal on Discrete Mathematics
A short note on the approximability of the maximum leaves spanning tree problem
Information Processing Letters
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Improved methods for approximating node weighted Steiner trees and connected dominating sets
Improved methods for approximating node weighted Steiner trees and connected dominating sets
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
A Near-linear-time Approximation Algorithm for Maximum-leaf Spanning Tree
A Near-linear-time Approximation Algorithm for Maximum-leaf Spanning Tree
On the Connected Domination Number of Random Regular Graphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs
ESA '02 Proceedings of the 10th Annual European Symposium on 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
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
Pricing Strategies for Viral Marketing on Social Networks
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
An approximation algorithm for the maximum leaf spanning arborescence problem
ACM Transactions on Algorithms (TALG)
A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
Multicast routing with minimum energy cost and minimum delay in wireless sensor networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Optimal wake-up scheduling of data gathering trees for wireless sensor networks
Journal of Parallel and Distributed Computing
Max-leaves spanning tree is APX-hard for cubic graphs
Journal of Discrete Algorithms
Kernelization for maximum leaf spanning tree with positive vertex weights
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem
Journal of Discrete Algorithms
Optical network design to minimize switching and transceiver equipment costs
Optical Switching and Networking
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
SIAM Journal on Discrete Mathematics
Kernel(s) for problems with no kernel: On out-trees with many leaves
ACM Transactions on Algorithms (TALG)
Approximation algorithms for the maximum internal spanning tree problem
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Parameterized algorithms for directed maximum leaf problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.05 |
We study the problem of finding a spanning tree with maximum number of leaves. We present a simple 2-approximation algorithm for the problem, improving on the approximation ratio of 3 achieved by the best previous algorithms. We also study the variant in which a given set of vertices must be leaves of the spanning tree, and we present a 5/2-approximation algorithm for this version of the problem.