A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Treein an Undirected Graph

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. A Parameterized Measure-and-Conquer Analysis for Finding a k-Leaf Spanning Tree in an Undirected Graph Daniel Binkele-Raible, Henning Fernau

[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.  Exact and Parameterized Algorithms for Max Internal Spanning Tree , 2008, Algorithmica.

[3]  Ryan Williams,et al.  Limits and Applications of Group Algebras for Parameterized Problems , 2009, ICALP.

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

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

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

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

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

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

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

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

[12]  Michael R. Fellows,et al.  The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number , 2007, CiE.

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

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

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

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

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

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

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

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

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

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

[23]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

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

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

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

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

[28]  Fedor V. Fomin,et al.  Exact exponential algorithms , 2013, CACM.

[29]  W. Marsden.  I and J , 2012 .