The following pages link to (Q4764186):
Displaying 7 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)
- Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm (Q4894856) (← links)
