Pages that link to "Item:Q4182533"
From MaRDI portal
The following pages link to The Complexity of Computing Steiner Minimal Trees (Q4182533):
Displayed 50 items.
- Steiner minimal trees for bar waves (Q580349) (← links)
- On better heuristics for Steiner minimum trees (Q687085) (← links)
- The full Steiner tree problem (Q702772) (← 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 algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
- Approximating the selected-internal Steiner tree (Q995588) (← links)
- A linear time algorithm for full Steiner trees (Q1068839) (← links)
- Exact computation of Steiner minimal trees in the plane (Q1076029) (← links)
- Steiner minimal trees for regular polygons (Q1085166) (← links)
- Steiner minimal trees on sets of four points (Q1091392) (← links)
- A decomposition theorem on Euclidean Steiner minimal trees (Q1112056) (← links)
- The Steiner problem in phylogeny is NP-complete (Q1167073) (← links)
- Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time (Q1167074) (← 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)
- On Steiner ratio conjectures (Q1179751) (← links)
- Minimal length tree networks on the unit sphere (Q1179757) (← links)
- The role of Steiner hulls in the solution to Steiner tree problems (Q1179758) (← links)
- On graphs preserving rectilinear shortest paths in the presence of obstacles (Q1179762) (← links)
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio (Q1186792) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- Graham's problem on shortest networks for points on a circle (Q1186796) (← links)
- Improved computation of plane Steiner minimal trees (Q1186797) (← links)
- Steiner minimal trees for a class of zigzag lines (Q1186798) (← links)
- Two new criteria for finding Steiner hulls in Steiner tree problems (Q1186803) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- The Steiner minimal network for convex configurations (Q1207800) (← links)
- Some remarks on the Steiner problem (Q1251668) (← links)
- Neural and delay based heuristics for the Steiner problem in networks (Q1296029) (← links)
- A neural network for the Steiner minimal tree problem (Q1323577) (← links)
- Some results on greedy algorithm conjectures (Q1331899) (← 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)
- Cut and patch Steiner trees for ladders (Q1356409) (← links)
- The Steiner ratio for the dual normed plane (Q1363707) (← links)
- The computational complexity of Steiner tree problems in graded matrices (Q1372300) (← links)
- Non-crossing of plane minimal spanning and minimal T1 networks (Q1377869) (← links)
- The Steiner ratio of high-dimensional Banach--Minkowski spaces. (Q1428549) (← links)
- Minimum Steiner trees in normed planes (Q1802220) (← links)
- A class of full Steiner minimal trees (Q1837695) (← links)
- Steiner's problem in double trees (Q1861809) (← links)
- On greedy heuristic for Steiner minimum trees (Q1891232) (← links)
- On component-size bounded Steiner trees (Q1894356) (← links)
- A tight lower bound for the Steiner ratio in Minkowski planes (Q1896344) (← links)
- Steiner minimal trees in \(L^ 2_ p\) (Q1923480) (← links)
- On the structure and complexity of the 2-connected Steiner network problem in the plane (Q1977645) (← links)