The following pages link to Steiner Minimal Trees (Q5542568):
Displayed 50 items.
- Some results on greedy algorithm conjectures (Q1331899) (← links)
- Variational approach and Steiner minimal trees on four points (Q1336673) (← links)
- Steiner polygons in the Steiner problem (Q1337104) (← links)
- A continuous version of a result of Du and Hwang (Q1337128) (← links)
- On the Steiner ratio in 3-space (Q1345879) (← links)
- Full minimal Steiner trees on lattice sets (Q1356020) (← links)
- The Steiner ratio for the dual normed plane (Q1363707) (← links)
- Faster geometric \(k\)-point MST approximation (Q1370933) (← links)
- Non-crossing of plane minimal spanning and minimal T1 networks (Q1377869) (← links)
- The Steiner tree problem in orientation metrics (Q1384537) (← links)
- The Steiner ratio of high-dimensional Banach--Minkowski spaces. (Q1428549) (← links)
- Minimum Steiner trees in normed planes (Q1802220) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- A short proof of a result of Pollak on Steiner minimal trees (Q1837195) (← links)
- A class of full Steiner minimal trees (Q1837695) (← links)
- Steiner trees in uniformly quasi-bipartite graphs. (Q1853068) (← links)
- On greedy heuristic for Steiner minimum trees (Q1891232) (← links)
- On component-size bounded Steiner trees (Q1894356) (← links)
- Steiner minimal trees on regular polygons with centre (Q1894775) (← links)
- A tight lower bound for the Steiner ratio in Minkowski planes (Q1896344) (← links)
- A direct solution of allocation problems (Q1903256) (← links)
- Steiner minimal trees in \(L^ 2_ p\) (Q1923480) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- Steiner distance and convexity in graphs (Q2426451) (← links)
- Cache placement in sensor networks under an update cost constraint (Q2466007) (← links)
- Improved approximation results for the minimum energy broadcasting problem (Q2471706) (← links)
- Generalizations on the parsimony question in evolution (Q2562138) (← links)
- ON CHARACTERISTIC AREA OF STEINER TREE (Q3007766) (← links)
- Approximating minimum Steiner point trees in Minkowski planes (Q3064040) (← links)
- The minimal spanning tree and the upper box dimension (Q3372096) (← links)
- IDENTIFYING STEINER MINIMAL TREES ON FOUR POINTS IN SPACE (Q3646210) (← links)
- A New Bound for the Steiner Ratio (Q3673572) (← links)
- Steiner Minimal Trees on Zig-Zag Lines (Q3673573) (← links)
- Steiner Minimal Tree for Points on a Circle (Q3728014) (← links)
- The 3‐vertex single source Weber location problem (Q3796938) (← links)
- Weber's problem and weiszfeld's algorithm in general spaces (Q3871838) (← links)
- Steiner's problem and fagnano's result on the sphere (Q3872168) (← links)
- (Q3907583) (← links)
- The 1-Steiner-Minimal-Tree problem in Minkowski-spaces (Q3978585) (← links)
- Computation of Minimal Length Full Steiner Trees on the Vertices of a Convex Polygon (Q4050137) (← links)
- Locating the vertices of a steiner tree in an arbitrary metric space (Q4077102) (← links)
- (Q4265788) (← links)
- Determining shortest networks in the Euclidean plane (Q4299277) (← links)
- Geometry and topology of local minimal 2-trees (Q4344725) (← links)
- (Q4519132) (← links)
- A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ (Q4546061) (← links)
- Cost-minimal trees in directed acyclic graphs (Q5181099) (← links)
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
- Some problems in discrete optimization (Q5636690) (← links)
- The steiner problem in graphs (Q5636923) (← links)