The following pages link to (Q4764186):
Displaying 20 items.
- Steiner trees with bounded RC-delay (Q527413) (← links)
- A better constant-factor approximation for selected-internal Steiner minimum tree (Q848949) (← links)
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- Approximating the selected-internal Steiner tree (Q995588) (← links)
- On Rajagopalan and Vazirani's \(\frac{3}{2}e\)-approximation bound for the iterated 1-Steiner heuristic (Q1007642) (← links)
- Delay-related secondary objectives for rectilinear Steiner minimum trees. (Q1427185) (← links)
- Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- Steiner hull algorithm for the uniform orientation metrics (Q2479469) (← links)
- An improved approximation scheme for the Group Steiner Problem (Q2709886) (← links)
- An Efficient Approximation Algorithm for the Steiner Tree Problem (Q3297834) (← links)
- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (Q3449515) (← links)
- Steiner Trees with Bounded RC-Delay (Q3453297) (← links)
- (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree (Q3511368) (← links)
- Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
- Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm (Q4894856) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
