Rectilinear group Steiner trees and applications in VLSI design

@article{Zachariasen2003RectilinearGS,
  title={Rectilinear group Steiner trees and applications in VLSI design},
  author={Martin Zachariasen and Andr{\'e} Rohe},
  journal={Mathematical Programming},
  year={2003},
  volume={94},
  pages={407-433}
}
  • Martin Zachariasen, André Rohe
  • Published 2003
  • Mathematics, Computer Science
  • Mathematical Programming
  • Abstract. Given a set of disjoint groups of points in the plane, the rectilinear group Steiner tree problem is the problem of finding a shortest interconnection (under the rectilinear metric) which includes at least one point from each group. This is an important generalization of the well-known rectilinear Steiner tree problem which has direct applications in VLSI design: in the detailed routing phase the logical units typically allow the nets to connect to several electrically equivalent… CONTINUE READING

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 28 REFERENCES

    The Rectilinear Steiner Tree Problem in NP Complete

    VIEW 1 EXCERPT

    A catalog of Hanan grid problems

    VIEW 1 EXCERPT

    Class Steiner Trees and VLSI-design

    VIEW 10 EXCERPTS
    HIGHLY INFLUENTIAL

    An approximation algorithm for the covering Steiner problem

    VIEW 1 EXCERPT

    Improved approximation bounds for the group Steiner problem

    VIEW 3 EXCERPTS

    Beyond Steiner's Problem: A VLSI Oriented Generalization

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL