Pages that link to "Item:Q810521"
From MaRDI portal
The following pages link to A variational approach to the Steiner network problem (Q810521):
Displaying 28 items.
- Directional derivative of the weight of a minimal filling in Riemannian manifolds (Q493881) (← links)
- The Steiner problem on surfaces of revolution (Q742573) (← links)
- Gradient-constrained minimum networks. II: Labelled or locally minimal Steiner points (Q1024825) (← links)
- The Steiner ratio conjecture for six points (Q1177947) (← links)
- A primer of the Euclidean Steiner problem (Q1179729) (← links)
- The Steiner ratio conjecture for cocircular points (Q1186084) (← links)
- Graham's problem on shortest networks for points on a circle (Q1186796) (← links)
- The Steiner minimal network for convex configurations (Q1207800) (← links)
- Symmetrization theorem of full Steiner trees (Q1328395) (← links)
- Some results on greedy algorithm conjectures (Q1331899) (← links)
- Variational approach and Steiner minimal trees on four points (Q1336673) (← links)
- Full minimal Steiner trees on lattice sets (Q1356020) (← links)
- Non-crossing of plane minimal spanning and minimal T1 networks (Q1377869) (← links)
- Convex relaxation and variational approximation of the Steiner problem: theory and numerics (Q1647911) (← links)
- A phase-field approximation of the Steiner problem in dimension two (Q1739065) (← links)
- Minimal curvature-constrained networks (Q1756754) (← links)
- On greedy heuristic for Steiner minimum trees (Q1891232) (← links)
- Computing Steiner points for gradient-constrained minimum networks (Q1952503) (← links)
- Analytic deformations of minimal networks (Q2202802) (← links)
- Upper and lower bounds for the lengths of Steiner trees in 3-space (Q2387794) (← links)
- Euclidean Steiner trees optimal with respect to swapping 4-point subtrees (Q2448203) (← 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)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- IDENTIFYING STEINER MINIMAL TREES ON FOUR POINTS IN SPACE (Q3646210) (← links)
- Determining shortest networks in the Euclidean plane (Q4299277) (← links)
- An analogue of Morse theory for planar linear networks and the generalized Steiner problem (Q4515774) (← links)
- Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I (Q5191142) (← links)
- Minimum Steiner trees on a set of concyclic points and their center (Q6071053) (← links)
