The following pages link to (Q5689037):
Displaying 34 items.
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- Wildlife corridors as a connected subgraph problem (Q456412) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- Geodesics and flows in a Poissonian city (Q549856) (← links)
- Steiner's invariants and minimal connections (Q931849) (← links)
- The Steiner forest problem revisited (Q972355) (← links)
- The Steiner tree problem in Kalmanson matrices and in circulant matrices (Q1304385) (← links)
- The computational complexity of Steiner tree problems in graded matrices (Q1372300) (← links)
- Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem (Q1400781) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- On the edge capacitated Steiner tree problem (Q2218647) (← links)
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees (Q2259027) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Approximate Euclidean Steiner trees (Q2397467) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- A tutorial on the balanced minimum evolution problem (Q2670555) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810) (← links)
- Reoptimization of Steiner Trees (Q3512464) (← links)
- Faster Steiner Tree Computation in Polynomial-Space (Q3541105) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q4619482) (← links)
- The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem (Q4680416) (← links)
- Multi-level Steiner Trees (Q4984869) (← links)
- (Q5090497) (← links)
- (Q5116496) (← links)
- Multi-Level Steiner Trees. (Q5140725) (← links)
- Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)
- (Q5743494) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem (Q6106606) (← links)
