The following pages link to Steiner Minimal Trees (Q5542568):
Displayed 50 items.
- An estimate of the objective function optimum for the network Steiner problem (Q271950) (← links)
- The length of an extremal network in a normed space: Maxwell formula (Q289734) (← links)
- Steiner tree problem with minimum number of Steiner points and bounded edge-length (Q294609) (← links)
- Maximising the worth of nascent networks (Q301061) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- The Fermat-Torricelli problem. I: A discrete gradient-method approach (Q368737) (← links)
- Packing, covering and tiling in two-dimensional spaces (Q472930) (← links)
- Minimum cost multicast routing using ant colony optimization algorithm (Q473657) (← links)
- Optimal design of virtual links in AFDX networks (Q483956) (← links)
- Solving a generalized Gauss problem (Q493345) (← links)
- Opaque sets (Q517796) (← links)
- Constrained BV functions on covering spaces for minimal networks and Plateau's type problems (Q528920) (← links)
- A partition-based relaxation for Steiner trees (Q535014) (← links)
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Steiner minimal trees for bar waves (Q580349) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- On better heuristics for Steiner minimum trees (Q687085) (← links)
- Evolutionary model for the Steiner tree problem with flow-dependent weights (Q733992) (← links)
- The Steiner problem on surfaces of revolution (Q742573) (← links)
- Lower bounds for rectilinear Steiner trees in bounded space (Q750175) (← links)
- A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (Q763244) (← links)
- Summarizing a set of time series by averaging: from Steiner sequence to compact multiple alignment (Q764307) (← links)
- Multi-colored spanning graphs (Q784473) (← links)
- Numerical minimization of geometrical type problems related to calculus of variations (Q809346) (← links)
- A variational approach to the Steiner network problem (Q810521) (← links)
- A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space (Q814961) (← links)
- An improved extra-gradient method for minimizing a sum of \(p\)-norms -- a variational inequality approach (Q853553) (← links)
- Steiner ratio for hyperbolic surfaces. (Q863754) (← links)
- Canonical decompositions of piecewise affine mappings, polyhedra-traces, and geometrical variational problems (Q950811) (← links)
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
- An entropy regularization technique for minimizing a sum of Tchebycheff norms (Q969313) (← links)
- The Steiner ratio conjecture of Gilbert-Pollak may still be open (Q973015) (← links)
- Comparison of distances between measures (Q1001104) (← links)
- The Steiner ratio conjecture is true for five points (Q1065011) (← links)
- A linear time algorithm for full Steiner trees (Q1068839) (← links)
- Hexagonal coordinate systems and Steiner minimal trees (Q1080858) (← links)
- Steiner minimal trees on sets of four points (Q1091392) (← links)
- A Steiner tree associated with three quarks (Q1099607) (← links)
- An algorithm for determining an opaque minimal forest of a convex polygon (Q1107998) (← links)
- A decomposition theorem on Euclidean Steiner minimal trees (Q1112056) (← links)
- Fast heuristic algorithms for rectilinear Steiner trees (Q1118419) (← links)
- Cost of sequential connection for points in space (Q1122502) (← links)
- The Steiner problem with edge lengths 1 and 2 (Q1123630) (← links)
- A fast algorithm for Steiner trees (Q1145507) (← links)
- The Steiner problem in phylogeny is NP-complete (Q1167073) (← links)
- Analytic formulas for full Steiner trees (Q1174509) (← links)
- The Steiner ratio conjecture for six points (Q1177947) (← links)
- Some upper bounds for minimal trees (Q1178229) (← links)
- A primer of the Euclidean Steiner problem (Q1179729) (← links)
- The Steiner ratio for five points (Q1179750) (← links)