23 Design Automation Conference, 1986, pp. 708–714. Fang, S. et al., Constrained Via
Minimization with Practical Considerations for Multi-Layer VLSI/PCB Routing Prob lems, 28." …

US7080336B2 - Method and apparatus for computing placement costs - Google Patents
US7080336B2 - Method and apparatus for computing placement costs - Google Patents Method …

A routing method that uses diagonal routes. This method routes several nets within a region
of a circuit layout. Each net includes a set of pins in the region. The method initially partitions …

US6738960B2 - Method and apparatus for producing sub-optimal routes for a net by generating
fake configurations - Google Patents US6738960B2 - Method and apparatus for producing …

US PATENT DOCUMENTS 6,349,403 B1 2/2002 Dutta et al.................... T16, 12 6,353,918
B1* 3/2002 Carothers et al............... T16/8 5,360,948 A 1 1/1994 Thornberg 6,366,279 B1 …

(51) Int. Cl. G06F 7/50(2006.01) A method for routing of some embodiments defines global
(52) US Cl.............................. 716/13; 716/12: 716/14 routes for nets in an arbitrary region of a …

Some embodiments of the invention provide a method that pre-computes routes for groups
of related net configurations. These routes are used by a router that uses a set of partitioning …

Some embodiments provide a method of pre-computing routes for nets in a region of a
circuit layout. The method initially defines a set of partitioning lines for partitioning the region …

Some embodiments provide a method of routing nets within a region of an integrated-circuit
(“IC”) layout. The method uses a first set of lines to partition the IC region into a plurality of …

US7003754B2 - Routing method and apparatus that use of diagonal routes - Google Patents
US7003754B2 - Routing method and apparatus that use of diagonal routes - Google Patents …