Pages that link to "Item:Q1336751"
From MaRDI portal
The following pages link to A short note on the approximability of the maximum leaves spanning tree problem (Q1336751):
Displaying 30 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- Memory-efficient enumeration of constrained spanning trees (Q294700) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← 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)
- Approximating the Maximally Balanced Connected Partition Problem in graphs (Q673224) (← links)
- The connected domination number of grids (Q831725) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- Minimal spanning trees with a constraint on the number of leaves (Q1291653) (← links)
- On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
- An exact algorithm for the maximum leaf spanning tree problem. (Q1413822) (← links)
- Spanning trees with a constraint on the number of leaves. A new formulation (Q1652247) (← links)
- Leafy spanning \(k\)-forests (Q2165258) (← links)
- The generalized definitions of the two-dimensional largest common substructure problems (Q2182100) (← links)
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks (Q2377384) (← links)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- The approximability of the weighted Hamiltonian path completion problem on a tree (Q2566021) (← links)
- Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem (Q2576247) (← links)
- Traceability of connected domination critical graphs (Q2656675) (← links)
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems (Q2839214) (← links)
- On Finding Directed Trees with Many Leaves (Q3656853) (← links)
- On the approximability of some maximum spanning tree problems (Q5096340) (← links)
- Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
- Spanning Trees with Many Leaves in Regular Bipartite Graphs (Q5387825) (← links)
- A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5443382) (← links)
- (Q5708519) (← links)
- Leafy spanning trees in hypercubes (Q5950587) (← links)
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)
