The Steiner Ratio of Banach-Minkowski Spaces
Let N be a finite set of points in the d-dimensional Banach-Minkowski space M d (B). In chapter 2 we saw that it is easy to find an MST for N; this is valid in the sense of the combinatorial structure as well as in the sense of computational complexity: A minimum spanning tree in the complete graph G = (N, ( 2 N )) with length-function f defined in f (vv′) = ‖v − v′‖ B is an MST for N in M d (B).
KeywordsUnit Ball Convex Body Minkowski Space Euclidean Plane Steiner Point
Unable to display preview. Download preview PDF.