Carousel greedy algorithms for the minimum stretch spanning tree problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1929927 (Why is no real title available?)
- A trade-off between space and efficiency for routing tables
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
- 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
- Approximating \(k\)-spanner problems for \(k>2\)
- Carousel greedy: a generalized greedy algorithm with applications in optimization
- General variable neighborhood search for the minimum stretch spanning tree problem
- Graph spanners
- Graph spanners: a tutorial review
- Minimum Diameter Spanning Trees and Related Problems
- Minimum restricted diameter spanning trees.
- On sparse spanners of weighted graphs
- On the fair comparison of optimization algorithms in different machines
- Optimality computation of the minimum stretch spanning tree problem
- Strategies for generating tree spanners: algorithms, heuristics and optimal graph classes
- The knapsack problem with forfeit sets
- The minimum stretch spanning tree problem for typical graphs
- The zoo of tree spanner problems
- Tree Spanners
- Tree spanners for bipartite graphs and probe interval graphs
- Tree spanners in planar graphs
- Tree spanners on chordal graphs: complexity and algorithms
This page was built for publication: Carousel greedy algorithms for the minimum stretch spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891480)
