Repository: DepositOnce â€“ institutional repository for research data and publications of TU Berlin https://depositonce.tu-berlin.de
TY - RPRT
AU - Bonsma, Paul
AU - Zickfeld, Florian
PY - 2008
TI - A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
DO - 10.14279/depositonce-14418
UR - http://dx.doi.org/10.14279/depositonce-14418
PB - Technische UniversitÃ¤t Berlin
LA - en
AB - We consider the problem of finding a spanning tree that maximizes the number of leaves (Max Leaf). We provide a 3/2-approximation algorithm for this problem when restricted to cubic graphs, improving on the previous 5/3-approximation for this class. To obtain this approximation we define a graph parameter x(G), and construct a tree with at least (n-x(G)+4)/3 leaves, and prove that no tree with more than (n-x(G)+2)/2 leaves exists. In contrast to previous approximation algorithms for Max Leaf, our algorithm works with connected dominating sets instead of constructing a tree directly. The algorithm also yields a 4/3-approximation for Minimum Connected Dominating Set in cubic graphs.
KW - spanning tree
KW - max leaf
KW - approximation
KW - cubic graph
ER -