A “GGreedy” channel router

Authors:
R. L. Rivest;C. M. Fiduccia
Affiliations:
MIT Laboratory for Computer Science, Cambridge, Mass., and GE Research and Development Center, Schenectady, New York;MIT Laboratory for Computer Science, Cambridge, Mass., and GE Research and Development Center, Schenectady, New York
Venue:
25 years of DAC Papers on Twenty-five years of electronic design automation
Year:
1988

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Optimal wiring between rectangles

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An optimum channel-routing algorithm for polycell layouts of integrated circuits

DAC '73 Proceedings of the 10th Design Automation Workshop
The complexity of design automation problems

DAC '80 Proceedings of the 17th Design Automation Conference
An optimal solution to a wire-routing problem (preliminary version)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A “Dogleg” channel router

DAC '76 Proceedings of the 13th Design Automation Conference
Wire routing by optimizing channel assignment within large apertures

DAC '71 Proceedings of the 8th Design Automation Workshop
The “PI” (placement and interconnect) system

DAC '82 Proceedings of the 19th Design Automation Conference
The minimum width routing of A 2-row 2-layer polycell-layout

DAC '79 Proceedings of the 16th Design Automation Conference
ALGORITHMS FOR INTEGRATED CIRCUIT LAYOUT: AN ANALYTIC APPROACH

ALGORITHMS FOR INTEGRATED CIRCUIT LAYOUT: AN ANALYTIC APPROACH

Hi-index	0.00