scientific article; zbMATH DE number 1305098
From MaRDI portal
Publication:4252040
Recommendations
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
- scientific article; zbMATH DE number 1947432
- A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
- Approximating Maximum Leaf Spanning Trees in Almost Linear Time
Cited in
(41)- Connected domination of regular graphs
- Approximating the maximum internal spanning tree problem
- An exact algorithm for the maximum leaf spanning tree problem.
- Dominating complex networks by identifying minimum skeletons
- Leafy spanning \(k\)-forests
- Approximating spanning trees with few branches
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
- On finding spanning trees with few leaves
- On maximum leaf trees and connections to connected maximum cut problems
- A 3-approximation algorithm for the maximum leaf \(k\)-forest problem
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs
- How heavy independent sets help to find arborescences with many leaves in DAGs
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems
- An approximation algorithm for the maximum leaf spanning arborescence problem
- scientific article; zbMATH DE number 6611438 (Why is no real title available?)
- Flow-based formulation for the maximum leaf spanning tree problem
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
- On finding directed trees with many leaves
- Improved bounds for spanning trees with many leaves
- Max-leaves spanning tree is APX-hard for cubic graphs
- Approximating Maximum Leaf Spanning Trees in Almost Linear Time
- Optimal wake-up scheduling of data gathering trees for wireless sensor networks
- scientific article; zbMATH DE number 1947432 (Why is no real title available?)
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
- A local-search algorithm for Steiner forest
- Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
- 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
- Spanning Trees with Many Leaves in Regular Bipartite Graphs
- A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
- Better Algorithms and Bounds for Directed Maximum Leaf Problems
- Leafy spanning trees in hypercubes
- Leafy spanning arborescences in DAGs
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree
- A new algorithm for finding trees with many leaves
- Spanning trees: A survey
- Spanning trees for many different numbers of leaves
- Network fault costs based on minimum leaf spanning trees
- 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252040)
