Pages that link to "Item:Q2930326"
From MaRDI portal
The following pages link to An approximation algorithm for the maximum leaf spanning arborescence problem (Q2930326):
Displaying 19 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems (Q2839214) (← links)
- (Q2992654) (← links)
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089) (← links)
- (Q3581682) (← links)
- On Finding Directed Trees with Many Leaves (Q3656853) (← links)
- (Q4258252) (← links)
- Complexity of spanning tree problems with leaf-dependent objectives (Q4887748) (← links)
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5302044) (← links)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844) (← links)
