An approximation algorithm for the maximum leaf spanning arborescence problem

Authors:
Matthew Drescher;Adrian Vetta
Affiliations:
McGill University, Quebec, Canada;McGill University, Quebec, Canada
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2010

Citing 5
Cited 10

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 Algorithms for Connected Dominating Sets

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Parameterized algorithms for directed maximum leaf problems

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

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

Graph-Theoretic Concepts in Computer Science
FPT algorithms and kernels for the Directedk- Leaf problem

Journal of Computer and System Sciences
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree

ACM Transactions on Algorithms (TALG)
Max-leaves spanning tree is APX-hard for cubic graphs

Journal of Discrete Algorithms
A faster exact algorithm for the directed maximum leaf spanning tree problem

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem

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

SIAM Journal on Discrete Mathematics
Kernel(s) for problems with no kernel: On out-trees with many leaves

ACM Transactions on Algorithms (TALG)
Parameterized approximation via fidelity preserving transformations

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an O(&sqrt;opt)-approximation algorithm for the maximum leaf spanning arborescence problem, where opt is the number of leaves in an optimal spanning arborescence. The result is based upon an O(1)-approximation algorithm for a special class of directed graphs called willows. Incorporating the method for willow graphs as a subroutine in a local improvement algorithm gives the bound for general directed graphs.