WADS 2003: Algorithms and Data Structures pp 207-218

Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles

• Matthias Müller-Hannemann
• Sven Peyer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2748)

Abstract

We consider the problem of finding a shortest rectilinear Steiner tree for a given set of points in the plane in the presence of rectilinear obstacles. The Steiner tree is allowed to run over obstacles; however, if we intersect the Steiner tree with some obstacle, then no connected component of the induced subtree must be longer than a given fixed length L. This kind of length restriction is motivated by its application in VLSI design where a large Steiner tree requires the insertion of buffers (or inverters) which must not be placed on top of obstacles.

We show that the length-restricted Steiner tree problem can be approximated with a performance guarantee of 2 in O(n logn) time, where n denotes the size of the associated Hanan grid. Optimal length-restricted Steiner trees can be characterized to have a special structure. In particular, we prove that a certain graph, which is a variant of the Hanan grid, always contains an optimal solution. Based on this structural result, we can improve the performance guarantee of approximation algorithms for the special case that all obstacles are of rectangular shape or of constant complexity, i.e. they are represented by at most a constant number of edges. For such a scenario, we give a $$\frac{5}{4}\alpha$$-approximation and a $$\frac{2k}{2k-1}\alpha$$-approximation for any integral k ≥ 4, where α denotes the performance guarantee for the ordinary Steiner tree problem in graphs.

Keywords

Rectilinear Steiner trees obstacles VLSI design approximation algorithms

References

1. 1.
Alpert, C.J., Gandham, G., Hu, J., Neves, J.L., Quay, S.T., Sapatnekar, S.S.: Steiner tree optimization for buffers, blockages and bays. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 20, 556–562 (2001)
2. 2.
Alpert, C.J., Kahng, A.B., Liu, B., Măndoiu, I., Zelikovsky, A.: Minimum buffered routing of non-critical nets for slew rate and reliability control. IEEE/ACM International Conference on Computer-Aided Design (ICCAD 2001), pp. 408–415 (2001) Google Scholar
3. 3.
Arora, S.: Polynomial time approximation schemes for the Euclidean traveling salesman and other geometric problems. Journal of the ACM 45, 753–782 (1998)
4. 4.
Berman, P., Ramaiyer, V.: Improved approximations for the Steiner tree problem. Journal of Algorithms 17, 381–408 (1994)
5. 5.
Borchers, A., Du, D.-Z., Gao, B., Wan, P.: The k-Steiner ratio in the rectilinear plane. Journal of Algorithms 29, 1–17 (1998)
6. 6.
Chen, D.Z., Klenk, K.S., Tu, H.T.: Shortest path queries among weighted obstacles in the rectilinear plane. SIAM J. on Computing 29, 1223–1246 (2000)
7. 7.
Chen, W., Pedram, M., Buch, P.: Buffered routing tree construction under buffer placement blockages. In: Proceedings of 7th ASPDAC and 15th International Conference on VLSI Design, pp. 381–386 (2002) Google Scholar
8. 8.
Chiang, C., Sarrafzadeh, M., Wong, C.K.: An algorithm for exact rectilinear Steiner trees for switchbox with obstacles. IEEE Transactions on Circuits and Systems — I: Fundamental Theory and Applications 39, 446–455 (1992)
9. 9.
Ganley, J.L., Cohoon, J.P.: Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles. In: Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 113–116 (1994)Google Scholar
10. 10.
Garey, M.R., Johnson, D.S.: The rectilinear Steiner tree problem is NP complete. SIAM Journal on Applied Mathematics 32, 826–834 (1977)
11. 11.
Hanan, M.: On Steiner’s problem with rectilinear distance. SIAM Journal on Applied Mathematics 14, 255–265 (1966)
12. 12.
Hwang, F.K.: On Steiner minimal trees with rectilinear distance. SIAM Journal on Applied Mathematics 30, 104–114 (1976)
13. 13.
Hwang, F.K., Richards, D.S., Winter, P.: The Steiner tree problem. Annals of Discrete Mathematics, vol. 53. North-Holland, Amsterdam (1992)
14. 14.
Mehlhorn, K.: A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters 27, 125–128 (1988)
15. 15.
Miriyala, S., Hashmi, J., Sherwani, N.: Switchbox Steiner tree problem in presence of obstacles. In: IEEE/ACM International Conference on Computer-Aided Design (ICCAD 1991), pp. 536–539 (1991)Google Scholar
16. 16.
Mitchell, J.S.B.: Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing 28, 1298–1309 (1999)
17. 17.
Müller-Hannemann, M., Peyer, S.: Approximation of rectilinear Steiner trees with length restrictions on obstacles, Tech. Report 03924, Research Institute for Discrete Mathematics, Bonn, Germany (2003) Google Scholar
18. 18.
Müller-Hannemann, M., Zimmermann, U.: Slack optimization of timing-critical nets, Tech. Report 03926, Research Institute for Discrete Mathematics, Bonn, Germany (2003)Google Scholar
19. 19.
Prömel, H.J., Steger, A.: The Steiner tree problem: A tour through graphs, algorithms, and complexity. In: Advanced lectures in mathematics. Vieweg (2002) Google Scholar
20. 20.
Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 770–779 (2000) Google Scholar
21. 21.
Zachariasen, M.: A catalog of Hanan grid problems. Networks 38, 76–83 (2001)
22. 22.
Zelikovsky, A.Z.: An $$\frac{11}{8}$$-approximation algorithm for the Steiner problem in networks with rectilinear distance. Coll. Math. Soc. J. Bolyai 60, 733–745 (1992)