A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs

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´s and Zwo´zniak’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.

• Type: Conference
• Year: 2007
• Where: WAOA
• Authors: José R. Correa, Cristina G. Fernandes, Martín Matamala, Yoshiko Wakabayashi
• Keywords: Algorithms, Connected Graph G, Cubic Graphs, Maximum Number, WAOA 2007