The following pages link to (Q2741494):
Displaying 16 items.
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- LS(graph): a constraint-based local search for constraint optimization on trees and paths (Q487640) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
- Solving minimum-cost shared arborescence problems (Q1751722) (← links)
- A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem (Q2270325) (← links)
- Reduction tests for the prize-collecting Steiner problem (Q2466593) (← links)
- Worst-case performance of Wong's Steiner tree heuristic (Q2489899) (← links)
- A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems (Q3009777) (← links)
- The Influence of Preprocessing on Steiner Tree Approximations (Q3467874) (← links)
- Preprocessing Steiner problems from VLSI layout (Q4785218) (← links)
- A distributed dual ascent algorithm for Steiner problems in multicast routing (Q5191138) (← links)
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs (Q5892561) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
