Pages that link to "Item:Q1085166"

The following pages link to Steiner minimal trees for regular polygons (Q1085166):

Displaying 20 items.

• Sparse hop spanners for unit disk graphs (Q824328) (← links)
• Hexagonal coordinate systems and Steiner minimal trees (Q1080858) (← links)
• A primer of the Euclidean Steiner problem (Q1179729) (← links)
• How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
• Cut and patch Steiner trees for ladders (Q1356409) (← links)
• Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047) (← links)
• Planar Manhattan local minimal and critical networks (Q1864609) (← links)
• Steiner minimal trees on regular polygons with centre (Q1894775) (← links)
• A Ginzburg-Landau model with topologically induced free discontinuities (Q2027775) (← links)
• On the history of the Euclidean Steiner tree problem (Q2249438) (← links)
• Minimal Networks: A Review (Q2977710) (← links)
• Determining shortest networks in the Euclidean plane (Q4299277) (← links)
• Geometry and topology of local minimal 2-trees (Q4344725) (← links)
• Steiner minimal trees in small neighbourhoods of points in Riemannian manifolds (Q4596677) (← links)
• Calibrations for minimal networks in a covering space setting (Q5118957) (← links)
• Extremal networks in $ \lambda$-geometry, where $ \lambda=3,4,6$ (Q5349063) (← links)
• A PTAS for the Steiner Forest Problem in Doubling Metrics (Q5376440) (← links)
• Steiner minimal trees for zigzag lines with ladders (Q5943383) (← links)
• (Q6065466) (← links)
• Minimum Steiner trees on a set of concyclic points and their center (Q6071053) (← links)