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
Journal of the ACM (JACM)
Approximating maximum leaf spanning trees in almost linear time
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Control Schemes in a Generalized Utility for Parallel Branch-and-Bound Algorithms
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Reformulation by intersection method on the MST problem with lower bound on the number of leaves
INOC'11 Proceedings of the 5th international conference on Network optimization
The fuzzy weighted k-cardinality tree and its hybrid genetic algorithm
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Optical network design to minimize switching and transceiver equipment costs
Optical Switching and Networking
An incremental distributed algorithm for a partial Grundy coloring of graphs
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.01 |
Given a connected graph, the Maximum Leaf Spanning Tree Problem (MLSTP) is to find a spanning tree whose number of leaves (degree-one vertices) is maximum. We propose a branch-and-bound algorithm for MLSTP, in which an upper bound is obtained by solving a minimum spanning tree problem. We report computational results for randomly generated graphs and grid graphs with up to 100 vertices.