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
ACM Computing Surveys (CSUR)
Improved methods for approximating node weighted Steiner trees and connected dominating sets
Improved methods for approximating node weighted Steiner trees and connected dominating sets
Approximating maximum leaf spanning trees in almost linear time
Journal of Algorithms
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Some APX-completeness results for cubic graphs
Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on 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
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Probabilistic checking of proofs; a new characterization of NP
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Graph-Theoretic Concepts in Computer Science
Spanning trees with many leaves in regular bipartite graphs
ISAAC'07 Proceedings of the 18th international conference on Algorithms and 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
Small independent edge dominating sets in graphs of maximum degree three
SOFSEM'06 Proceedings of the 32nd 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
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
The problem of finding spanning trees with maximal number of leaves is considered. We present a linear-time algorithm for cubic graphs that achieves approximation ratio 7/4. The analysis of the algorithm uses a kind of the accounting method, that is of independent interest.