The following pages link to The zoo of tree spanner problems (Q2476246):
Displaying 13 items.
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- On minimum average stretch spanning trees in grid graphs (Q510965) (← links)
- Minimum cut bases in undirected networks (Q968141) (← links)
- An improved algorithm for computing all the best swap edges of a tree spanner (Q1986961) (← links)
- The minimum stretch spanning tree problem for typical graphs (Q2046233) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- On minimum average stretch spanning trees in polygonal 2-trees (Q2339451) (← links)
- Optimality computation of the minimum stretch spanning tree problem (Q2656713) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- A Faster Computation of All the Best Swap Edges of a Tree Spanner (Q3460719) (← links)
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner (Q5136230) (← links)
- Lower bounds for strictly fundamental cycle bases in grid graphs (Q5191140) (← links)
- General variable neighborhood search for the minimum stretch spanning tree problem (Q6063503) (← links)
