Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs
From MaRDI portal
Recommendations
- Approximating minimum MAX-stretch spanning trees on unweighted graphs
- On the approximability of some maximum spanning tree problems
- On the approximability of some Maximum Spanning Tree Problems
- The minimum stretch spanning tree problem for typical graphs
- Approximating minimum bounded degree spanning trees to within one of optimal
- scientific article; zbMATH DE number 1756011
- Approximating the Minimum Spanning Tree Weight in Sublinear Time
- Maximizing spanning trees in almost complete graphs
Cited in
(28)- An improved algorithm for computing all the best swap edges of a tree spanner
- The zoo of tree spanner problems
- Graph spanners: a tutorial review
- On approximating tree spanners that are breadth first search trees
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- Spanners in sparse graphs
- 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
- Optimality characterization of the minimum stretch spanning tree problem for interval graphs
- The minimum stretch spanning tree problem for typical graphs
- Tree 3-spanners on generalized prisms of graphs
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- A Faster Computation of All the Best Swap Edges of a Tree Spanner
- Polynomial time approximation schemes for the constrained minimum spanning tree problem
- Max-stretch reduction for tree spanners
- Better hardness results for the minimum spanning tree congestion problem
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Bicriteria approximation for minimum dilation graph augmentation
- Iterated local search with two strategies in the acceptance criterion for the tree t-spanner problem
- An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
- Spanning trees with minimum weighted degrees
- Swapping labeled tokens on graphs
- Carousel greedy algorithms for the minimum stretch spanning tree problem
- Better hardness results for the minimum spanning tree congestion problem
- Temporal graph realization with bounded stretch
- On minimum average stretch spanning trees in grid graphs
- Algorithms and Data Structures
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 Q3642863)
