Pages that link to "Item:Q1802062"
From MaRDI portal
The following pages link to A faster approximation algorithm for the Steiner tree problem in graphs (Q1802062):
Displaying 9 items.
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- Digital data networks design using genetic algorithms (Q1590811) (← links)
- Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
- An improved approximation scheme for the Group Steiner Problem (Q2709886) (← links)
- The Influence of Preprocessing on Steiner Tree Approximations (Q3467874) (← links)
- Strong Steiner Tree Approximations in Practice (Q4629541) (← links)
- Steiner trees and polyhedra (Q5946818) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- The Clustered Selected-Internal Steiner Tree Problem (Q6114856) (← links)