Approximating minimum MAX-stretch spanning trees on unweighted graphs
From MaRDI portal
Recommendations
- Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- Tree Spanners
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- scientific article; zbMATH DE number 1262806
Cited in
(13)- Spanners of bounded degree graphs
- The zoo of tree spanner problems
- Max-stretch reduction for tree spanners
- Strategies for generating tree spanners: algorithms, heuristics and optimal graph classes
- Network flow spanners
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
- Using petal-decompositions to build a low stretch spanning tree
- On minimum average stretch spanning trees in grid graphs
- Algorithms and Data Structures
- Structural characterizations of tree t-spanners for graphs with few P₄'s and (0, )-graphs
- Collective tree spanners in graphs with bounded parameters
- Sparse geometric graphs with small dilation
This page was built for publication: Approximating minimum MAX-stretch spanning trees on unweighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501267)
