A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5344 LNCS, Issue , 2008, Pages 66-77

  Bonsma, Paul ^a   Zickfeld, Florian ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithm; Connected dominating set; Cubic graph; Maximum leaf

Indexed keywords

AD HOC NETWORKS; COMPUTATIONAL GEOMETRY; COMPUTERS; MOBILE TELECOMMUNICATION SYSTEMS; POLYNOMIAL APPROXIMATION; TECHNICAL PRESENTATIONS; TREES (MATHEMATICS);

CONNECTED DOMINATING SET; CUBIC GRAPH; GRAPH PARAMETERS; MAXIMUM LEAF; SPANNING TREES;

APPROXIMATION ALGORITHMS;

EID: 58349112871     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92248-3_7     Document Type: Conference Paper

References (19)

1. Bonsma, P.: Spanning trees with many leaves in graphs with minimum degree three. SIAM J. Discrete Math. 22(3), 920-937 (2008)
2. Bonsma, P., Zickfeld, F.: Spanning trees with many leaves in graphs without diar monds and blossoms. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 531-543. Springer, Heidelberg (2008)
3. Cheng, X., Huang, X., Li, D., Wu, W., Du, D.: A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks 42(4), 202-208 (2003)
4. Correa, J.R., Fernandes, C.G., Matamala, M., Wakabayashi, Y.: A 5/3-approximation for finding spanning trees with many leaves in cubic graphs. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 184-192. Springer, Heidelberg (2008)
5. Diestel, R.: Graph Theory. Springer, New York (1997)
6. Drescher, M., Vetta, A.: An approximation algorithm for the max leaf spanning arborescence problem. ACM transactions on algorithms (to appear)
7. Estivill-Castro, V., Fellows, M.R., Langston, M.A., Rosamond, F.A.: FPT is Ptime extremal structure I. In: ACiD 2005. Texts in algorithmics, vol. 4, pp. 1-41. King's College Publications (2005)
8. n. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 152-163. Springer, Heidelberg (2006)
9. Galbiati, G., Morzenti, A., Maffioli, F.: On the approximability of some maximum spanning tree problems. Theoret. Comput. Sci. 181(1), 107-118 (1997)
10. Griggs, J.R., Kleitman, D. J., Shastri, A.: Spanning trees with many leaves in cubic graphs. J. Graph Theory 13(6), 669-695 (1989)
11. Griggs, J.R., Wu, M.: Spanning trees in graphs of minimum degree 4 or 5. Discrete Math. 104(2), 167-183 (1992)
12. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374-387 (1998)
13. Kleitman, D.J., West, D.B.: Spanning trees with many leaves. SIAM J. Discrete Math. 4(1), 99-106 (1991)
14. Lemke, P.: The maximum-leaf spanning tree problem in cubic graphs is NP-complete. IMA publication no. 428, University of Minnesota, Mineapolis (1988)
15. Lorys, K., Zwozniak, G.: Approximation algorithm for the maximum leaf spanning tree problem for cubic graphs. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 686-697. Springer, Heidelberg (2002)
16. Lu, H., Ravi, R.: Approximating maximum leaf spanning trees in almost linear time. Journal of Algorithms 29(1), 132-141 (1998)
17. Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., Ko, K.: A greedy approximation for minimum connected dominating sets. Theoret. Comput. Sci. 329(1-3), 325-330 (2004)
18. 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)
19. Zickfeld, F.: Geometric and combinatorial structures on graphs. PhD thesis, Technische Universität Berlin, Berlin (2007)