Skip to main content
SpringerLink
Log in

Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

The Symmetric Rectilinear Steiner Arborescence (SRStA) problem is defined as follows: given a set of terminals in the positive quadrant of the plane, connect them using horizontal and vertical lines such that each terminal can be reached from the origin via a y-monotone path and the total length of all the line segments is the minimum possible. Finding an SRStA has applications in VLSI design, in data structures used in some optimization algorithms and in dynamic server problems. In this paper, we provide a polynomial time approximation scheme for the SRStA problem, improving the previous best approximation ratio of 3 for this problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berman, P. and Coulston, C. (1997), On-line Algorithms for Steiner Tree Problems, Proc. of the 29th ACM Symp. on Theory of Computing, pp. 344–353.

  2. Charikar, M., Halperin, D. and Motwani, R. (1998), The Dynamic Servers Problem, Proc. of 9th ACM-SIAM Symp. on Discrete Algorithms, pp. 410–419.

  3. Du, D.-Z., Pan, L.-Q. and Shing, M.-T. (1986), Minimum edge length guillotine rectangular partition. Report 02418-86, Math. Sci. Res. Inst., Univ. California, Berkeley, CA.

    Google Scholar 

  4. Lu, B. and Ruan, l. (2000), Polynomial Time Approximation Scheme for Rectilinear Steiner Arborescence problem, J. of Combinatorial Optimization 4: 357-363.

    Google Scholar 

  5. Papadimitriou, C. H., Ramanathan, S. and Rangan, P.V. (1995), Optimal Information Delivery, Proc. of the 6th Annual International Symposium on Algorithms and Computation, pp. 181–187.

  6. Preparata, F.P. and Shamos, M.I. (1988), Computational Geometry-An Introduction, Springer-Verlag, Berlin.

    Google Scholar 

  7. Mitchell, J.S.B. (1996), Guillotine subdivisions approximate polygonal subdivisions: a simple new method for the geometric k-MST problem. Proc. 7th ACM-SIAM Sympos. Discrete Algorithms, pp. 402–408.

  8. Mitchell, J.S.B. Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. Manuscript, Available at http://ams.sunysb.edu/~jsbm/jsbm.html

  9. Mitchell, J.S.B. Guillotine subdivisions approximate polygonal subdivisions: Part II-a simple polynomial-time approximation scheme for geometric k-MST, TSP, and related problems. Available at http://ams.sunysb.edu/~jsbm/jsbm.html

  10. Rao, S., Sadayappan, P., Hwang F., and Shor, P. (1992), The Rectilinear Steiner Arborescence Problem, Algorithmica, pp. 277–288.

  11. Shi, W. and Su, C. (2000), The rectilinear Steiner Arborescence Problem is NP-complete, Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 780–787.

  12. Trubin, V.A. (1985) Subclass of the Steiner Problems on a Plane with Rectilinear metric, Cybernatics 21: 320-322 (translated from Kibernetika 21(3): 1985, pp. 37–40).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Minnesota, Minneapolis, MN, 55455, USA

    Xiuzhen Cheng & Bing Lu

  2. Rutgers University campus at Camden, USA

    Bhaskar DasGupta

Authors
  1. Xiuzhen Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bhaskar DasGupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bing Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cheng, X., DasGupta, B. & Lu, B. Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem. Journal of Global Optimization 21, 385–396 (2001). https://doi.org/10.1023/A:1012730702524

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012730702524

Search

Navigation