Advertisement

Minimum rectilinear steiner trees for intervals on two parallel lines

  • Edmund Ihler
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 657)

Abstract

We consider the problem Rectilinear Class Steiner Tree (channel) where we have pairwise not intersecting intervals of required points, partitioned into so called classes, lying on two parallel horizontal lines in the plane. A shortest rectilinear tree is to be found, connecting at least one point of each class. One of our results shows that Rectilinear Class Steiner Tree (channel) is NP-hard, even if each class consists of at most three single points. But we give an exact algorithm that has linear time complexity, if roughly spoken for no vertical line more than a constant number of classes contain points on the right and also not on the right side of this line.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AGH77]
    A. V. Aho, M. R. Garey, and F. K. Hwang. Rectilinear Steiner trees: Efficient special-case algorithms. Networks, 7:37–58, 1977.Google Scholar
  2. [AS90]
    P. K. Agarwal and M.-T. Shing. Algorithms for special cases of rectilinear Steiner trees: 1. Points on the boundary of a rectilinear rectangle. Networks, 20:453–485, 1990.Google Scholar
  3. [GJ77]
    M. R. Garey and D. S. Johnson. The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math., 32(4):826–834, 1977.Google Scholar
  4. [GJ79]
    M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.Google Scholar
  5. [Han66]
    M. Hanan. On Steiner's problem with rectilinear distance. SIAM J. Appl. Math., 14(2):255–265, 1966.Google Scholar
  6. [Ihl91]
    E. Ihler. Bounds on the quality of approximate solutions to the Group Steiner Problem. In Graph-Theoretic Concepts in Computer Science, WG90, volume 484 of Lecture Notes in Computer Science, pages 109–118. Springer, 1991.Google Scholar
  7. [Ihl92]
    E. Ihler. The complexity of approximating the Class Steiner Tree problem. In Graph-Theoretic Concepts in Computer Science, WG91, volume 570 of Lecture Notes in Computer Science, pages 85–96. Springer, 1992.Google Scholar
  8. [KPS90]
    B. Korte, H. J. Prömel, and A. Steger. Steiner trees in VLSI-layout. In B. Korte, L. Lovász, H. J. Prömel, and A. Schrijver, editors, Paths, Flows, and VLSI-Layout, pages 185–214. Springer, 1990.Google Scholar
  9. [Len90]
    T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Wiley & Sons, 1990.Google Scholar
  10. [OW90]
    T. Ottmann and P. Widmayer. Algorithmen und Datenstrukturen. BI-Wiss.-Verl., 1990.Google Scholar
  11. [Rei91]
    G. Reich. Shortest trees for intervals of points in the switchbox. Technical report, Institut für Informatik, Universität Freiburg, 1991.Google Scholar
  12. [RW89]
    G. Reich and P. Widmayer. Approximate minimum spanning trees for vertex classes. Technical report, Institut für Informatik, Universität Freiburg, 1989.Google Scholar
  13. [SW91]
    M. Sarrafzadeh and C.K. Wong. New directions in the rectilinear Steiner tree problem. Technical report, Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, and IBM Watson Research Center, Yorktown Heights, New York, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Edmund Ihler
    • 1
  1. 1.Departement InformatikETH ZürichZürich

Personalised recommendations