Pages that link to "Item:Q5096340"
From MaRDI portal
The following pages link to On the approximability of some maximum spanning tree problems (Q5096340):
Displaying 17 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- On the approximability of robust spanning tree problems (Q620950) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← 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)
- Hardness and efficiency on minimizing maximum distances in spanning trees (Q2197544) (← 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)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs (Q3642863) (← links)
- (Q4258252) (← links)
- Maximizing spanning trees in almost complete graphs (Q4355482) (← links)
- Approximation algorithms for somek-source shortest paths spanning tree problems (Q5471085) (← 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)
