On the crossing distribution problem
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Heuristics and Experimental Design for Bigraph Crossing Number Minimization
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
Journal of Experimental Algorithmics (JEA)
Eliminating wire crossings for molecular quantum-dot cellular automata implementation
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
An ILP for the metro-line crossing problem
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
On approximating the maximum simple sharing problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.03 |
In this paper we study the problem of “properly” distributing the set of crossings (i.e., intersection of nets), of a given global routing, among the regions. Each region is assigned a quota, being the maximum number of crossings allowed in that region, which depends on its area and its complexity (e.g., the number of wets going through it and the number of terminals it contains). The crossing distribution problem (CDP) is to find a net ordering at each boundary as to minimize the total number of crossings and to satisfy the quotas. We propose an O(mn2+mξ3/2) time algorithm for CDP, where m is the number of modules, n is the number of nets, and ξ is the number of crossings