An Amortized Search Tree Analysis for Finding a k -Leaf Spanning Tree in an Undirected Graph

The problem of finding a spanning tree in an undirected graph with a maximum number of leaves is known to be NP-hard. We present an algorithm which finds a spanning tree with at least k leaves in time O*(3.4575k) which improves the currently best algorithm. The estimation of the running time is done by using a non-standard measure. The present paper is one of the still few examples that employ the Measure & Conquer paradigm of algorithm analysis in the area of Parameterized Algorithmics.

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

[2]  Henning Fernau,et al.  A new upper bound for Max-2-SAT: A graph-theoretic approach , 2010, J. Discrete Algorithms.

[3]  Henning Fernau,et al.  An Amortized Search Tree Analysis for k-Leaf Spanning Tree , 2009, SOFSEM.

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

[5]  Henning Fernau,et al.  Exact and Parameterized Algorithms for Max Internal Spanning Tree , 2008, Algorithmica.

[6]  Henning Fernau,et al.  Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs , 2008, WALCOM.

[7]  Michael R. Fellows,et al.  FPT is P-Time Extremal Structure I , 2005, ACiD.

[8]  Gerhard J. Woeginger,et al.  A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves , 2003, MFCS.

[9]  Fedor V. Fomin,et al.  Exact exponential algorithms , 2010, CACM.

[10]  Shekhar Verma,et al.  A Power Aware Minimum Connected Dominating Set for Wireless Sensor Networks , 2009, J. Networks.

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

[12]  Xiuzhen Cheng,et al.  Connected Dominating Set in Sensor Networks and MANETs , 2004 .

[13]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[14]  Magnus Wahlström,et al.  Algorithms, measures and upper bounds for satisfiability and related problems , 2007 .

[15]  Nadine Schwartges,et al.  Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs , 2011, WAOA.

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

[17]  Henning Fernau,et al.  An Exact Exponential Time Algorithm for Power Dominating Set , 2012, Algorithmica.

[18]  Joachim Kneis,et al.  Algorithmica manuscript No. (will be inserted by the editor) A New Algorithm for Finding Trees with Many Leaves , 2022 .

[19]  Michael R. Fellows,et al.  The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number , 2007, Theory of Computing Systems.

[20]  R. Ravi,et al.  Approximating Maximum Leaf Spanning Trees in Almost Linear Time , 1998, J. Algorithms.

[21]  Robert James Douglas,et al.  NP-completeness and degree restricted spanning trees , 1992, Discret. Math..

[22]  Henning Fernau,et al.  An exact algorithm for the Maximum Leaf Spanning Tree problem , 2009, Theor. Comput. Sci..

[23]  Gregory Gutin,et al.  Digraphs - theory, algorithms and applications , 2002 .

[24]  Paul S. Bonsma,et al.  Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms , 2007, LATIN.

[25]  Henning Fernau,et al.  An exact exponential-time algorithm for the Directed Maximum Leaf Spanning Tree problem , 2012, J. Discrete Algorithms.

[26]  Ge Xia,et al.  Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems , 2003, Algorithmica.

[27]  A. Bonato,et al.  Dominating Biological Networks , 2011, PloS one.

[28]  Ding-Zhu Du,et al.  Connected Dominating Sets in Wireless Networks with Different Transmission Ranges , 2007, IEEE Transactions on Mobile Computing.

[29]  Michael R. Fellows,et al.  Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems , 2000, FSTTCS.

[30]  Paul S. Bonsma,et al.  A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs , 2008, WG.

[31]  Henning Fernau,et al.  Breaking the 2n-barrier for Irredundance: Two lines of attack , 2011, J. Discrete Algorithms.

[32]  Ryan Williams,et al.  LIMITS and Applications of Group Algebras for Parameterized Problems , 2009, ACM Trans. Algorithms.