Experimental results for a linear program global router

Une nouvelle approche au probleme d'acheminement global dans les circuits VLSI est proposee. Elle est basee sur une formulation du probleme en utilisant la programmation entiere. Une procedure efficace de resolution des problemes sousjacents lies a la programmation entiere est proposee

[1]  Prabhakar Raghavan,et al.  Provably good routing in graphs: regular arrays , 1985, STOC '85.

[2]  Scott Kirkpatrick,et al.  Global Wiring by Simulated Annealing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[4]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[5]  Michael Burstein,et al.  Hierarchical Wire Routing , 1983, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Richard M. Karp,et al.  Global wire routing in two-dimensional arrays , 1987, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[7]  Prabhakar Raghavan,et al.  A Language for Describing Rectilinear Steiner Tree Configurations. , 1986, DAC 1986.

[8]  Man-Tak Shing,et al.  A decomposition algorithm for circuit routing , 1985 .

[9]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[10]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..