Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves

  title={Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves},
  author={H. Fernau and F. Fomin and D. Lokshtanov and Daniel Raible and S. Saurabh and Yngve Villanger},
  • H. Fernau, F. Fomin, +3 authors Yngve Villanger
  • Published in STACS 2009
  • Mathematics, Computer Science
  • The {\sc $k$-Leaf Out-Branching} problem is to find an out-branching, that is a rooted oriented spanning tree, with at least $k$ leaves in a given digraph. The problem has recently received much attention from the viewpoint of parameterized algorithms. Here, we take a kernelization based approach to the {\sc $k$-Leaf-Out-Branching} problem. We give the first polynomial kernel for {\sc Rooted $k$-Leaf-Out-Branching}, a variant of {\sc $k$-Leaf-Out-Branching} where the root of the tree searched… CONTINUE READING
    70 Citations

    Topics from this paper

    Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
    • B. Jansen
    • Mathematics, Computer Science
    • CIAC
    • 2010
    • 4
    • PDF
    On Finding Directed Trees with Many Leaves
    • 36
    • PDF
    A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem
    • 3
    Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems
    • G. Gutin
    • Mathematics, Computer Science
    • Electron. Notes Discret. Math.
    • 2009
    • 6
    A linear-time kernelization for the Rooted k-Leaf Outbranching Problem
    • F. Kammer
    • Computer Science, Mathematics
    • Discret. Appl. Math.
    • 2015
    • 3
    • Highly Influenced
    • PDF
    Fixed Parameter Complexity of the Weighted Max Leaf Problem
    • 3
    • PDF