Cited By
View all- Han SSahni SOfek HO'Neill L(1985)Layering algorithms for single row routingProceedings of the 22nd ACM/IEEE Design Automation Conference10.5555/317825.317938(516-522)Online publication date: 1-Jun-1985
Cell overlaps in the results of global placement are guaranteed to prevent successful routing. However, common techniques for fixing these problems may endanger routing in a different way --- through increased wirelength and congestion. We evaluate ...
In this paper, we present a new global router, NTHU-Route, for modern designs. NTHU-Route is based on iterative rip-ups and reroutes, and several techniques are proposed to enhance our global router. These techniques include (1) a history based cost ...
The problem of minimizing the number of interstreet crossings in single-row routing, known to be intractable in the sense of NP-completeness is studied. An efficient heuristic algorithm for solving this problem is presented. The worst-case computational ...
IEEE Press
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in