Pages that link to "Item:Q1186792"

The following pages link to A proof of the Gilbert-Pollak conjecture on the Steiner ratio (Q1186792):

Displaying 40 items.

• Steiner tree problem with minimum number of Steiner points and bounded edge-length (Q294609) (← links)
• Packing, covering and tiling in two-dimensional spaces (Q472930) (← links)
• Minimum weight convex Steiner partitions (Q548652) (← links)
• A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\) (Q763244) (← links)
• A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space (Q814961) (← links)
• Canonical decompositions of piecewise affine mappings, polyhedra-traces, and geometrical variational problems (Q950811) (← links)
• The Steiner ratio conjecture of Gilbert-Pollak may still be open (Q973015) (← links)
• A primer of the Euclidean Steiner problem (Q1179729) (← links)
• A simple proof of the planar rectilinear Steiner ratio (Q1200801) (← links)
• On spanning 2-trees in a graph (Q1356500) (← links)
• The Steiner ratio for the dual normed plane (Q1363707) (← links)
• Non-crossing of plane minimal spanning and minimal T1 networks (Q1377869) (← links)
• On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks (Q1410692) (← links)
• The Steiner ratio of high-dimensional Banach--Minkowski spaces. (Q1428549) (← links)
• Minimum Steiner trees in normed planes (Q1802220) (← links)
• On greedy heuristic for Steiner minimum trees (Q1891232) (← links)
• Steiner minimal trees on regular polygons with centre (Q1894775) (← links)
• A tight lower bound for the Steiner ratio in Minkowski planes (Q1896344) (← links)
• An average case analysis of a greedy algorithm for the on-line Steiner tree problem (Q1921250) (← links)
• Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
• On the structure and complexity of the 2-connected Steiner network problem in the plane (Q1977645) (← links)
• Steiner type ratios of Gromov-Hausdorff space (Q2311363) (← links)
• Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
• A PTAS for the geometric connected facility location problem (Q2408564) (← links)
• The Steiner ratio Gilbert-Pollak conjecture is still open (Q2428669) (← links)
• Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\) (Q2434638) (← links)
• Localization of minimax points (Q2481114) (← links)
• Two-connected Steiner networks: structural properties (Q2488236) (← links)
• Generalized Maxwell formula for the length of a minimal tree with a given topology (Q2513136) (← links)
• On approximation ratios of minimum-energy multicast routing in wireless networks (Q2569162) (← links)
• Branched coverings and Steiner ratio (Q2827759) (← links)
• Minimal Networks: A Review (Q2977710) (← links)
• ON CHARACTERISTIC AREA OF STEINER TREE (Q3007766) (← links)
• Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies \documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document}$ 1 \leq m \leq \sqrt{3} (Q3087623) (← links)
• Reducing the Steiner problem in four uniform orientations (Q4506270) (← links)
• Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
• The Steiner Minimal Tree problem in the λ-geometry plane (Q5871886) (← links)
• Approximations for Steiner trees with minimum number of Steiner points (Q5958113) (← links)
• Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\) (Q5961625) (← links)
• A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) (Q6113557) (← links)