On Finding Directed Trees with Many Leaves

The ROOTED MAXIMUM LEAF OUTBRANCHING problem consists in finding a spanning directed tree rooted at some prescribed vertex of a digraph with the maximum number of leaves. Its parameterized version asks if there exists such a tree with at least k leaves. We use the notion of s ? t numbering studied in [19,6,20] to exhibit combinatorial bounds on the existence of spanning directed trees with many leaves. These combinatorial bounds allow us to produce a constant factor approximation algorithm for finding directed trees with many leaves, whereas the best known approximation algorithm has a $\sqrt{OPT}$-factor [11]. We also show that ROOTED MAXIMUM LEAF OUTBRANCHING admits an edge-quadratic kernel, improving over the vertex-cubic kernel given by Fernau et al [13].

[1]  László Lovász,et al.  Rubber bands, convex embeddings and graph connectivity , 1988, Comb..

[2]  Paul S. Bonsma,et al.  An FPT Algorithm for Directed Spanning k-Leaf , 2007, ArXiv.

[3]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[4]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[5]  Michael R. Fellows,et al.  FPT is P-Time Extremal Structure I (Fixed-parameter tractability is polynomial-time extremal structure theory) , 2005 .

[6]  Fabrizio Grandoni,et al.  Solving Connected Dominating Set Faster than 2n , 2007, Algorithmica.

[7]  P. Seymour,et al.  Spanning trees with many leaves , 2001 .

[8]  Adrian Vetta,et al.  An approximation algorithm for the maximum leaf spanning arborescence problem , 2010, TALG.

[9]  Noga Alon,et al.  Spanning Directed Trees with Many Leaves , 2008, SIAM J. Discret. Math..

[10]  Gregory Gutin,et al.  FPT algorithms and kernels for the Directed k-Leaf problem , 2008, J. Comput. Syst. Sci..

[11]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[12]  Michael R. Fellows,et al.  Fixed-Parameter Tractability is Polynomial-Time Extremal Structure Theory I: The Case of Max Leaf , 2005 .

[13]  James A. Storer,et al.  Constructing Full Spanning Trees for Cubic Graphs , 1981, Inf. Process. Lett..

[14]  Henning Fernau,et al.  Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves , 2009, STACS.

[15]  Noga Alon,et al.  Parameterized Algorithms for Directed Maximum Leaf Problems , 2007, ICALP.

[16]  Francesco Maffioli,et al.  A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem , 1994, Inf. Process. Lett..

[17]  Roberto Solis-Oba,et al.  A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves , 1998, Algorithmica.

[18]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[19]  Michael R. Fellows,et al.  On Problems without Polynomial Kernels (Extended Abstract) , 2008, ICALP.

[20]  John H. Reif,et al.  Directeds-t numberings, Rubber bands, and testing digraphk-vertex connectivity , 1994, SODA '92.

[21]  Rolf Niedermeier,et al.  Invitation to data reduction and problem kernelization , 2007, SIGA.

[22]  Joachim Kneis,et al.  A New Algorithm for Finding Trees with Many Leaves , 2008, ISAAC.