BibTeX
@MISC{Chen98oncrossing,
author = {Hsiao-Feng Steven Chen and D. T. Lee},
title = {On Crossing Minimization Problem},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we consider a problem related to global routing post-optimization: the crossing minimization problem (CMP). Given a global routing representation, the CMP is to minimize redundant crossings between every pair of nets. In particular, there are two kinds of CMP: constrained CMP (CCMP) and unconstrained CMP (UCMP). These problems have been studied previously in [Groe89], where an O(m 2 n) algorithm was proposed for CCMP, and in [MS95], where an (mn 2 +¸ 2 ) algorithm was proposed for UCMP, where m is the total number of modules, n is the number of nets, and ¸ is the number of crossings defined by an initial global routing topology. We present a simpler and faster O(mn) algorithm for CCMP and an O(n(m + ¸)) time algorithm for UCMP. Both algorithms improve over the time bounds of the previously proposed algorithms. The novel part of our algorithm is that it uses the plane embedding information of globally routed nets in the routing area to construct a graph-based framewo...
