Euclidean Constructibility in Graph-Minimization Problems

DOI10.2307/2688541MaRDI QIDQ5578238zbMATH OpenOpenAlexWikidataFDO

Authors E. J. Cockayne, Z. A. Melzak

Publication date 1969

Full work available at URL https://doi.org/10.2307/2688541

zbMATH Keywords

elementary geometry

Cited in

(14)

• Minimal length tree networks on the unit sphere
• On the Steiner ratio in 3-space
• Improved upper bounds for the Steiner ratio
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
• The Fermat-Torricelli theorem in convex geometry
• Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
• CONSTRUCTING OPTIMAL HIGHWAYS
• The Fermat-Torricelli problem. I: A discrete gradient-method approach
• Gathering of oblivious robots on infinite grids with minimum traveled distance
• The Weiszfeld Algorithm: Proof, Amendments, and Extensions
• Optimal Gathering Over Weber Meeting Nodes in Infinite Grid
• The stability of Fermat-Torricelli problem's locus in normed planes
• The Fermat-Torricelli problem in normed spaces
• On stars and Steiner stars

This page was built for publication: Euclidean Constructibility in Graph-Minimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5578238)