Performance results of the simplex algorithm for a set of real-world linear programming models
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Automatic layout of low-cost quick-turnaround random-logic custom LSI devices
DAC '76 Proceedings of the 13th Design Automation Conference
LTX - a system for the directed automatic design of LSI circuits
DAC '76 Proceedings of the 13th Design Automation Conference
PRO - an automatic string placement program for polycell layout
DAC '76 Proceedings of the 13th Design Automation Conference
DAC '76 Proceedings of the 13th Design Automation Conference
DAC '82 Proceedings of the 19th Design Automation Conference
CALMOS: A portable software system for the automatic and interactive layout of MOS/LSI
DAC '79 Proceedings of the 16th Design Automation Conference
Performance driven global routing for standard cell design
Proceedings of the 1997 international symposium on Physical design
| Hi-index | 0.00 |
The problem of global routing in standard cell layouts so as to minimize total channel density is considered. A sub-problem of this, called the linear net routing problem (LNRP), is defined and is argued to be the key to a successful solution to the general problem. A polynomial-time heuristic for LNRP is presented and its behavior analyzed. In particular, it is proven that the heuristic can produce results as bad as, but no worse than, 50% over the optimal.