Abstract
Given a set of points P in a metric space, let l(P) denote the ratio of lengths between the shortest k-edge-connected Steiner network and the shortest k-edge-connected spanning network on P, and let r = inf l(P) ∣ P for k ≥ 1. In this paper, we show that in any metric space, r ≥ 3/4 for k ≥ 2, and there exists a polynomial-time α-approximation for the shortest k-edge-connected Steiner network, where α = 2 for even k and α = 2 + 4/(3k) for odd k. In the Euclidean plane, \(r_k \geqslant \sqrt 3 /2,\;\;r_3 \leqslant (\sqrt 3 + 2)/4\) and \(r_4 \leqslant (7 + 3\sqrt 3 )/(9 + 2\sqrt 3 )\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. Bienstock, E.F. Brickell, and C.L. Monma, “On the structure of minimum-weight k-connected networks,” SIAM J. on Discrete Mathematics, vol. 3, pp. 320-329, 1990.
N. Christofides, “Worst-case Analysis of a New Heuristic for the Traveling Salesman Problem,” Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, 1976.
D.-Z. Du and F.K. Hwang, “A proof of Gilbert-Pollak's conjecture on the Steiner ratio,” Algorithmica, vol. 7, pp. 121-136, 1992.
D.-Z. Du and F.K. Hwang, “The State of Art on Steiner Ratio Problems,” in Computing in Euclidean Geometry, D.-Z. Du and F.K. Hwang (Eds.), World Scientific Publishing Cl. Pte. Ltd., 1995, pp. 195-222.
J. Edmonds, “Edge-disjoint Branchings,” in Combinatorial Algorithms, R. Rustin (Ed.), Academic Press: New York, USA, 1973, pp. 91-96.
E.N. Gilbert and H.O. Pollak, “Steiner minimal trees,” SIAM J. Appl. Math., vol. 16, pp. 1-16, 1968.
D.F. Hsu and X.-D. Hu, “On shortest two-edge connected Steiner networks with Euclidean distance,” Networks, vol. 32, pp. 133-140, 1998.
D.F. Hsu and X.-D. Hu, “On Shortest Three-edge Connected Steiner Networks with Euclidean Distance,” Discrete Applied Mathematics, to appear.
D.F. Hsu, X.-D. Hu, and Y. Kajitani, “On shortest k-edge connected Steiner networks with rectilinear distance,” Nonconvex Optimization and its Application, vol. 4, pp. 119-127, 1995.
D.F. Hsu, X.-D. Hu, and G.-H. Lin, “On minimum-weight k-edge connected Steiner networks on metric spaces,” Graphs and Combinatorics, to appear.
F.K. Hwang, “On Steiner minimal trees with rectilinear distance,” SIAM J. Appl. Math., vol. 30, pp. 104-114, 1976.
J.B. Kruskal, “On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,” Proc. ACM, vol. 7, 1956, pp. 48-50.
W. Mader, “A reduction method for edge-connectivity in graphs,” Ann. of Discrete Math., vol. 3, pp. 145-164, 1978.
C.L. Monma, B.S. Munson, and W.R. Pulleyblank, “Minimum-weight two-connected spanning networks,” Math. Prog., vol. 46, pp. 153-171, 1990.
C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Inc.: Englewood Cliffs, New Jersy, USA, 1982.
Rights and permissions
About this article
Cite this article
Du, X., Hu, X. & Jia, X. On Shortest k-Edge-Connected Steiner Networks in Metric Spaces. Journal of Combinatorial Optimization 4, 99–107 (2000). https://doi.org/10.1023/A:1009889023408
Issue Date:
DOI: https://doi.org/10.1023/A:1009889023408