Approximating maximum leaf spanning trees in almost linear time
Journal of 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 feedback set problems and their duals in tournaments
Theoretical Computer Science - Parameterized and exact computation
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
IEEE Transactions on Mobile Computing
Solving Connected Dominating Set Faster than 2 n
Algorithmica - Parameterized and Exact Algorithms
Hardness and Approximability of the Inverse Scope Problem
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Enumerating Precursor Sets of Target Metabolites in a Metabolic Network
WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
Graph-Theoretic Concepts in Computer Science
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
FPT algorithms and kernels for the Directedk- Leaf problem
Journal of Computer and System Sciences
On Finding Directed Trees with Many Leaves
Parameterized and Exact Computation
An Amortized Search Tree Analysis for k-Leaf Spanning Tree
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
An approximation algorithm for the maximum leaf spanning arborescence problem
ACM Transactions on Algorithms (TALG)
Dominating sets in directed graphs
Information Sciences: an International Journal
Exact Exponential Algorithms
Breaking the 2n-barrier for Irredundance: Two lines of attack
Journal of Discrete Algorithms
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
ACM Transactions on Algorithms (TALG)
An exact algorithm for the Maximum Leaf Spanning Tree problem
Theoretical Computer Science
A New Algorithm for Finding Trees with Many Leaves
Algorithmica
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
A parameterized route to exact puzzles: breaking the 2n-barrier for irredundance (Extended Abstract)
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Kernel(s) for problems with no kernel: On out-trees with many leaves
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
Given a directed graph G=(V,A), the Directed Maximum Leaf Spanning Tree problem asks to compute a directed spanning tree with as many leaves as possible. By designing a branching algorithm analyzed with Measure&Conquer, we show that the problem can be solved in time O^@?(1.9044^n) using polynomial space. Allowing exponential space, this run time upper bound can be lowered to O^@?(1.8139^n). We also provide an example showing a lower-bound for the running time of our algorithm.