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 27 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- Max-min weight balanced connected partition (Q386475) (← links)
- On the approximability of robust spanning tree problems (Q620950) (← 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)
- On finding optimal and near-optimal lineal spanning trees (Q1105381) (← links)
- The maximum \(f\)-depth spanning tree problem (Q1603381) (← links)
- An improved algorithm for the \(k\)-source maximum eccentricity spanning trees (Q1887071) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544) (← links)
- Constructing a spanning tree with many leaves (Q2256702) (← links)
- On the set of extreme core allocations for minimal cost spanning tree problems (Q2397642) (← links)
- Max-stretch reduction for tree spanners (Q2480904) (← links)
- Inapproximability and approximability of maximal tree routing and coloring (Q2498986) (← 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)
- Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs (Q3642863) (← links)
- (Q4258252) (← links)
- Maximizing spanning trees in almost complete graphs (Q4355482) (← links)
- The full-degree spanning tree problem (Q4761320) (← 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)
- Approximation algorithms for somek-source shortest paths spanning tree problems (Q5471085) (← links)
- (Q5708519) (← links)
- A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5896083) (← links)
- A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5919326) (← links)
- Social distancing network creation (Q6107894) (← links)
