Paper Info
Title
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Abstract
We consider the problem of finding a spanning tree that maximizes the number of leaves (MaxLeaf). 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 MaxLeaf, 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.
Year
DOI
Venue
2011
10.1137/100801251
Workshop on Graph-Theoretic Concepts in Computer Science
Keywords
Field
DocType
previous approximation algorithm,graph parameter,cubic graph,algorithm work,connected dominating set,2-approximation algorithm,finding spanning trees,cubic graphs,spanning tree,approximation algorithm
Discrete mathematics,Dominating set,Trémaux tree,Combinatorics,Tree-depth,k-minimum spanning tree,Connected dominating set,Spanning tree,Kruskal's algorithm,Mathematics,Minimum spanning tree
Journal
Volume
Issue
ISSN
25
4
0895-4801
Citations 
PageRank 
References 
11
0.55
21
Authors
2
Name
Order
Citations
PageRank
Paul Bonsma128720.46
Florian Zickfeld2524.14