Faster approximation algorithms for the rectilinear steiner tree problem
The classical Steiner Tree Problem requires a shortest tree spanning a given vertex subset within a graph G=(V, E). An important variant is the Steiner tree problem in rectilinear metric. Only recently two algorithms were found which achieve better approximations than the ’traditional’ one with a factor of 3/2. These algorithms with an approximation ratio of 11/8 are quite slow and run in time O(n3) and O(n5/2). A new simple implementation reduces the time to O(n3/2). As our main result we present efficient parameterized algorithms which reach a performance ratio of 11/8+ε for any ε>0 in time O(n · log2n), and a ratio of 11/8+log log n log n in time O(n · log3n).
KeywordsAlgorithms Steiner tree Approximations
Unable to display preview. Download preview PDF.
- 1.P. Berman. Personal communication. 1992.Google Scholar
- 2.P. Berman, V. Ramaiyer. Improved approximations for the Steiner tree problem. Proceedings, 3rd ACM-SiAM Symposium on Discrete Algorithms, 325–334, 1992.Google Scholar
- 3.M.W.Bern, R.L.Graham. The shortest-network problem. Sci.American, 1, 66–71, 1989.Google Scholar
- 4.Ding-Zhu Du, Yanjun Zhang, Qing Feng. On better heuristic for Euclidean Steiner minimum trees. Proceedings, 32nd Foundations of Computer Science, 431–439, 1991.Google Scholar
- 5.D. Eppstein, G.F. Italiano, et al. Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. Proceedings of 1st ACM-SIAM Symposium on Discrete Algorithms, 1–11, 1990.Google Scholar
- 11.R. M. Karp. Reducibility among combinatorial problems. In Miller and Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York 85–103, 1972.Google Scholar
- 12.B.Korte, H.J.Prömel, A. Steger. Steiner Trees in VLSI-Layout. In Korte et al.: Paths, Flows and VLSI-Layout, Springer, 1990.Google Scholar
- 13.Th.Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley, 1990.Google Scholar
- 14.K. Mehihorn. Data Structures and Algorithms III: Multidimensional Data Structures and Comp. Geo. Springer, 1985.Google Scholar
- 16.H. Takahashi, A. Matsuyama. An approximate solution for the Steiner problem in graphs. Math. Japonica, 24: 573–577, 1980.Google Scholar
- 20.A. Z. Zelikovsky. The 11/8-approximation algorithm for the Steiner problem on Networks with rectilinear distance. In Sets, Graphs and Numbers. Coll. Math. Soc. J. Bolyai 60, 733–745, 1992.Google Scholar