An approximation algorithm for the maximum leaf spanning arborescence problem
From MaRDI portal
Recommendations
- Approximating Maximum Leaf Spanning Trees in Almost Linear Time
- scientific article; zbMATH DE number 1305098
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
- On finding directed trees with many leaves
- A faster exact algorithm for the directed maximum leaf spanning tree problem
Cited in
(24)- Parameterized approximation via fidelity preserving transformations
- Scatter search for the minimum leaf spanning tree problem
- On maximum leaf trees and connections to connected maximum cut problems
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
- Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs
- scientific article; zbMATH DE number 6611438 (Why is no real title available?)
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
- scientific article; zbMATH DE number 5777935 (Why is no real title available?)
- On finding directed trees with many leaves
- Max-leaves spanning tree is APX-hard for cubic graphs
- Approximating Maximum Leaf Spanning Trees in Almost Linear Time
- scientific article; zbMATH DE number 1330076 (Why is no real title available?)
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
- Complexity of spanning tree problems with leaf-dependent objectives
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
- Better Algorithms and Bounds for Directed Maximum Leaf Problems
- A new algorithm for finding trees with many leaves
- Low recourse arborescence forests under uniformly random arcs
- A 4/3-approximation for the maximum leaf spanning arborescence problem in DAGs
- A \(\frac{4}{3}\)-approximation for the maximum leaf spanning arborescence problem in DAGs
- FPT algorithms and kernels for the directed k-leaf problem
- Reformulations and solution algorithms for the maximum leaf spanning tree problem
This page was built for publication: An approximation algorithm for the maximum leaf spanning arborescence problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930326)
