Minkowski-plane bead-gap tightness conjecture for Steiner minimum paths
Minkowski-plane bead-gap tightness conjecture for Steiner minimum paths
Let be a set of terminals in a Minkowski plane with unit ball , and let and be a -SMT and a -MSPT on , respectively. Minkowski-plane bead-gap conjecture. The upper bound
is tight if and only if is not a parallelogram. This conjecture concerns the sharp performance gap between Steiner minimum trees and minimum Steiner point trees in Minkowski planes; the supplied text gives no resolution.
Sources & referencesView supporting material
Primary source
M. Brazil, C. J. Ras and D. A. Thomas, “Approximating Minimum Steiner Point Trees in Minkowski Planes”, arXiv:1307.2987 (2013).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.