The following pages link to (Q4945796):
Displaying 37 items.
- A geometric characterisation of the quadratic min-power centre (Q297177) (← links)
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167) (← links)
- Splitting trees at vertices (Q616363) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- Computing skeletons for rectilinearly convex obstacles in the rectilinear plane (Q779860) (← links)
- A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space (Q814961) (← links)
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
- Short trees in polygons (Q1348253) (← links)
- Delay-related secondary objectives for rectilinear Steiner minimum trees. (Q1427185) (← links)
- New pruning rules for the Steiner tree problem and 2-connected Steiner network problem (Q1631775) (← 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)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions (Q1699618) (← links)
- A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction (Q1708730) (← links)
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (Q1741111) (← links)
- Optimal Steiner hull algorithm (Q1862120) (← links)
- On Steiner trees and minimum spanning trees in hypergraphs (Q1869998) (← links)
- On the structure and complexity of the 2-connected Steiner network problem in the plane (Q1977645) (← links)
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
- Computing Euclidean Steiner trees over segments (Q2219516) (← links)
- Generalised \(k\)-Steiner tree problems in normed planes (Q2258073) (← links)
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2343089) (← links)
- Geometry-experiment algorithm for Steiner minimal tree problem (Q2375521) (← links)
- Bounding component sizes of two-connected Steiner networks (Q2380015) (← links)
- Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees (Q2466792) (← links)
- A catalog of Hanan grid problems (Q2748382) (← links)
- Worst-case ratios of networks in the rectilinear plane (Q2764995) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- (Q4242783) (← links)
- Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane (Q4628046) (← links)
- Minimum cost flow‐dependent communication networks (Q5487822) (← links)
- Improved algorithms for the Steiner problem in networks (Q5946826) (← links)
- Solving the prize‐collecting Euclidean Steiner tree problem (Q6071078) (← links)
- A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$ (Q6080617) (← links)
- Simplifying obstacles for Steiner network problems in the plane (Q6087564) (← links)
- A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) (Q6113557) (← links)
- (Q6179336) (← links)
