Routing a Multi-Terminal Critical Net: Steiner Tree Construction in the Presence of Obstacles

@inproceedings{Ganley1994RoutingAM,
  title={Routing a Multi-Terminal Critical Net: Steiner Tree Construction in the Presence of Obstacles},
  author={Joseph L. Ganley and James P. Cohoon},
  booktitle={ISCAS},
  year={1994}
}
This paper presents a new model for VLSI routing in the presence of obstacles, that transforms any routing instance from a geometric problem into a graph problem. It is the first model that allows computation of optimal obstacle-avoiding rectilinear Steiner trees in time corresponding to the instance size (the number of terminals and obstacle border segments) rather than the size of the routing area. For the most common multi-terminal critical nets-those with three or four terminals-we observe… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 87 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 58 extracted citations

88 Citations

01020'94'99'05'11'17
Citations per Year
Semantic Scholar estimates that this publication has 88 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

A heuristic for Euclidean and rectilinear Steiner problems

  • J . E. Beasley
  • European Journal of Operational Research,
  • 1992

A neighborhood improvement algorithm for rectilinear Steiner trees

  • K. Wong
  • In Proceedings of the International Conference on…
  • 1990

Optimal twoterminal a-/3 wire routing

  • D. S. Richards
  • Integration: the VLSI Journal,
  • 1988

An algorithm for path connections and its applications

  • Y. Lee
  • IRE Transactions on Electronic Computers,
  • 1961

Similar Papers

Loading similar papers…