Pages that link to "Item:Q1802062"

The following pages link to A faster approximation algorithm for the Steiner tree problem in graphs (Q1802062):

Displaying 20 items.

• Approximating the tree and tour covers of a graph (Q688437) (← links)
• On efficient implementation of an approximation algorithm for the Steiner tree problem (Q911286) (← links)
• A note on ''A faster approximation algorithm for the Steiner problem in graphs'' (Q1178221) (← links)
• A fast and simple Steiner routing heuristic (Q1276958) (← links)
• A parallel algorithm for computing Steiner trees in strongly chordal graphs (Q1329803) (← links)
• Digital data networks design using genetic algorithms (Q1590811) (← links)
• Faster algorithm for optimum Steiner trees (Q1944205) (← 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 Power of Dynamic Distance Oracles (Q2941483) (← links)
• An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
• The Influence of Preprocessing on Steiner Tree Approximations (Q3467874) (← links)
• (Q3519877) (← links)
• A fast algorithm for computing steiner edge connectivity (Q3581294) (← links)
• (Q4038157) (← links)
• Efficient path and vertex exchange in steiner tree algorithms (Q4367276) (← 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)