A 5/3-approximation 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 4927 LNCS, Issue , 2008, Pages 184-192

  Correa, José R ^a   Fernandes, Cristina G ^b   Matamala, Martín ^c   Wakabayashi, Yoshiko ^b  

^a UNIVERSIDAD ADOLFO IBÁÑEZ   (Chile)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

^c UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL THEORY; GRAPH THEORY; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

CONNECTED GRAPHS; CUBIC GRAPHS; LOWER AND UPPER BOUNDS; LOWER BOUNDS; MINIMUM DEGREE; NP-HARD; ON-LINE ALGORITHMS; SPANNING TREES;

APPROXIMATION ALGORITHMS;

EID: 49949112416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77918-6_15     Document Type: Conference Paper

References (12)

1. 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)
2. 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)
3. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
4. Griggs, J., Kleitman, D., Shastri, A.: Spanning trees with many leaves in cubic graphs. Journal of Graph Theory 13(6), 669-695 (1989)
5. Kleitman, D., West, D.: Spanning trees with many leaves. SIAM Journal on Discrete Mathematics 4(1), 99-106 (1991)
6. Lemke, P.: The maximum-leaf spanning tree problem in cubic graphs is NPcomplete. In: IMA Preprint Series 428, Mineapolis (1988)
7. SLinial, N., Sturtevant, D.: Private communication (1987) (see [5])
8. 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)
9. 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)
10. Lu, H.I., Ravi, R.: Approximating maximum leaf spanning trees in almost linear time. Journal of Algorithms 29(1), 132-141 (1998)
11. 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)
12. Storer, J.: Constructing full spanning trees for cubic graphs. Information Processing Letters 13(1), 8-11 (1981)