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

Authors:
José R. Correa;Cristina G. Fernandes;Martín Matamala;Yoshiko Wakabayashi
Affiliations:
School of Business, Universidad Adolfo Ibáñez, Chile;Department of Computer Science, Universidade de São Paulo, Brazil;Departamento de Ingeniería Matemática, Universidad de Chile, Chile;Department of Computer Science, Universidade de São Paulo, Brazil
Venue:
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Year:
2007

Citing 4
Cited 4

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
Approximating maximum leaf spanning trees in almost linear time

Journal of Algorithms
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms

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

Graph-Theoretic Concepts in Computer Science
Spanning trees with many leaves in graphs without diamonds and blossoms

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Max-leaves spanning tree is APX-hard for cubic graphs

Journal of Discrete Algorithms
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

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 Lorys and Zwozniak'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.