Pages that link to "Item:Q1391300"
From MaRDI portal
The following pages link to On the approximability of some Maximum Spanning Tree Problems (Q1391300):
Displaying 7 items.
- Max-min weight balanced connected partition (Q386475) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161) (← links)
- Constructing a spanning tree with many leaves (Q2256702) (← links)
- Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214) (← links)
- FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS (Q2905305) (← links)
- Social distancing network creation (Q6107894) (← links)
