11
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

The net adding problem

&
Pages 15-21 | Received 10 Mar 1994, Published online: 19 Mar 2007

References

  • Baker , B. S. , Bhatt , S. N. and Leighton , F. T. 1983 . An approximation algorithm for Manhattan routing . Proc. 15th Ann. ACM Symp. on Theory of Computing , : 477 – 478 .
  • Hamachi , G. T. and Ousterhout , J. K. 1984 . A switchbox router with obstacle avoidance, in Proc . 21st IEEE Design Automat. Conf. , : 173 – 179 .
  • Ho , J. M. , Sarrafzadeh , M. , Vijayan , G. and Wong , C. K. 1990 . Layer assignment for multichip modules . IEEE Trans. Computer-Aided Design , : 1272 – 1277 .
  • Hu , T. C. and Kuh , K. S. , eds. 1985 . “ VLSI Circuit Layout:Theory and Design, Selected Reprint Series ” . New York : IEEE Press .
  • Lie , M. and Horng , C. S. 1982 . A bus router for IC layout . In Proc. 19th Design automation Conf. , : 129 – 132 .
  • Mehlhorn , K. , Preparata , F. P. and Sarrafzadeh , M. 1986 . Channel routing in knock-knee mode: simplified algorithms and proofs . Algorithmca , 1 : 213 – 221 .
  • Miracky et al , R. 1991 . Technology for rapid prototyping for multichip modules . Proc. IEEE Conf. Computer Design , 1 : 588 – 591 .
  • Sarrafzadeh , M. and Lee , D. T. 1989 . A New approach to topological via minimization . IEEE Trans. Computer-Aided Design , 8 : 890 – 900 .
  • Sherwani , N. 1993 . Kluwer Academic Publishers .
  • van Emde Boas , P. 1977 . Preserving order in a forest in less than logarithmic time and linear space . Inform. Process. Lett. , 6 : 80 – 82 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.