Abstract
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improve on Loryś and Zwoźniak’s result presenting a 5/3-approximation for this problem on cubic graphs. This result is a consequence of new lower and upper bounds for L(G) which are interesting on their own. We also show a lower bound for L(G) that holds for graphs with minimum degree at least 3.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bonsma, P.: Spanning trees with many leaves: new extremal results and an improved FPT algorithm. Technical report, Faculty of EEMCS, University of Twente, The Netherlands (2006)
Galbiati, G., Maffioli, F., Morzenti, A.: A short note on the approximability of the maximum leaves spanning tree problem. Information Processing Letters 52(1), 45–49 (1994)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Griggs, J., Kleitman, D., Shastri, A.: Spanning trees with many leaves in cubic graphs. Journal of Graph Theory 13(6), 669–695 (1989)
Kleitman, D., West, D.: Spanning trees with many leaves. SIAM Journal on Discrete Mathematics 4(1), 99–106 (1991)
Lemke, P.: The maximum-leaf spanning tree problem in cubic graphs is NP-complete. In: IMA Preprint Series 428, Mineapolis (1988)
SLinial, N., Sturtevant, D.: Private communication (1987) (see [5])
Lory, K., Zwoźniak, G.: Approximation algorithm for maximum leaf spanning tree problem for cubic graphs. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 686–698. Springer, Heidelberg (2002)
Lu, H.I., Ravi, R.: The power of local optimization: Approximation algorithms for maximum-leaf spanning tree. In: Proceedings of 13th Annual Allerton Conference on Communication, Control, and Computing, pp. 533–542 (1992)
Lu, H.I., Ravi, R.: Approximating maximum leaf spanning trees in almost linear time. Journal of Algorithms 29(1), 132–141 (1998)
Solis-Oba, R.: 2-approximation algorithm for finding a spanning tree with maximum number of leaves. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 441–452. Springer, Heidelberg (1998)
Storer, J.: Constructing full spanning trees for cubic graphs. Information Processing Letters 13(1), 8–11 (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Correa, J.R., Fernandes, C.G., Matamala, M., Wakabayashi, Y. (2008). A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs. In: Kaklamanis, C., Skutella, M. (eds) Approximation and Online Algorithms. WAOA 2007. Lecture Notes in Computer Science, vol 4927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77918-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-77918-6_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77917-9
Online ISBN: 978-3-540-77918-6
eBook Packages: Computer ScienceComputer Science (R0)