Approximating Steiner Trees and Forests with Minimum Number of Steiner Points
نویسندگان
چکیده
Let R be a finite set of terminals in a metric space (M,d). We consider finding a minimum size set S ⊆ M of additional points such that the unit-disc graph G[R ∪ S] of R ∪ S satisfies some connectivity properties. In the Steiner Tree with Minimum Number of Steiner Points (ST-MSP) problem G[R ∪ S] should be connected. In the more general Steiner Forest with Minimum Number of Steiner Points (SF-MSP) problem we are given a set D ⊆ R × R of demand pairs and G[R ∪ S] should contains a uv-path for every uv ∈ D. Let ∆ be the maximum number of points in a unit ball such that the distance between any two of them is larger than 1. It is known that ∆ = 5 in R. The previous known approximation ratio for ST-MSP was ⌊(∆+1)/2⌋+1+ǫ in an arbitrary normed space [15], and 2.5+ ǫ in the Euclidean space R [5]. Our approximation ratio for ST-MSP is 1+ln(∆−1)+ǫ in an arbitrary normed space, which in R reduces to 1+ln 4+ǫ < 2.3863+ǫ. For SF-MSP we give a simple ∆approximation algorithm, improving the folklore ratio 2(∆− 1). Finally, we generalize and simplify the ∆-approximation of Calinescu [3] for the 2-Connectivity-MSP problem, where G[R ∪ S] should be 2-connected.
منابع مشابه
Approximating Minimum Steiner Point Trees in Minkowski
Given a set of points, we define a minimum Steiner point tree to be a tree interconnecting these points and possibly some additional points such that the length of every edge is at most 1 and the number of additional points is minimized. We propose using Steiner minimal trees to approximate minimum Steiner point trees. It is shown that in arbitrary metric spaces this gives a performance differe...
متن کاملApproximating minimum Steiner point trees in Minkowski planes
Given a set of points, we define a minimum Steiner point tree to be a tree interconnecting these points and possibly some additional points such that the length of every edge is at most 1 and the number of additional points is minimized. We propose using Steiner minimal trees to approximate minimum Steiner point trees. It is shown that in arbitrary metric spaces this gives a performance differe...
متن کاملA note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
We give a tight analysis of the MST heuristic recently introduced by G.-H. Lin and G. Xue for approximating the Steiner tree with minimum number of Steiner points and bounded edge-lengths. The approximation factor of the heuristic is shown to be one less than the MST number of the underlying space, de ned as the maximum possible degree of a minimum-degree MST spanning points from the space. In ...
متن کاملMinimum Steiner Trees in Normed Planes
A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimum possible total length. In this note we investigate various properties of minimum Steiner trees in normed planes, i.e., where the "unit disk" is an arbitrary compact convex centrally symmetric domain D having nonempty interior. We show that if the boundary of D is strictly convex and di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014