Euclidean Constructibility in Graph-Minimization Problems
From MaRDI portal
Publication:5578238
DOI10.2307/2688541zbMath0185.48701OpenAlexW4238196893WikidataQ62065777 ScholiaQ62065777MaRDI QIDQ5578238
Publication date: 1969
Full work available at URL: https://doi.org/10.2307/2688541
Related Items (12)
On stars and Steiner stars ⋮ On the Steiner ratio in 3-space ⋮ Improved upper bounds for the Steiner ratio ⋮ The Fermat-Torricelli problem. I: A discrete gradient-method approach ⋮ Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings ⋮ The Fermat-Torricelli theorem in convex geometry ⋮ Optimal Gathering Over Weber Meeting Nodes in Infinite Grid ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Minimal length tree networks on the unit sphere ⋮ Gathering of oblivious robots on infinite grids with minimum traveled distance ⋮ CONSTRUCTING OPTIMAL HIGHWAYS ⋮ The Weiszfeld Algorithm: Proof, Amendments, and Extensions
This page was built for publication: Euclidean Constructibility in Graph-Minimization Problems
