Via assignment in single row routing

1. Bondy J. and U.S.R.Murthy, Graph Theory with Applications, Elsevier North Holland Inc, 1976.

   Google Scholar 

2. Cohoon J. and S.Sahni, Heuristics for the Board Permutation Problem, Proc. 1983 IEEE ICCAD Conf.

   Google Scholar 

3. Fiorini S. and R.J. Wilson, Edge-Coloring of Graphs, Research notes in Mathematics, 16, Pitman, London, 1977.

   Google Scholar 

4. Garey M.R. and D.S. Johnson, Computer and Intractibility: A Guide to the Theory of NP-Completeness, W.H.Freeman, San Francisco, 1979.

   Google Scholar 

5. Gonzalez T., An Approximation Algorithm for the Via Assignment Problem, ICCAD, 1983, pp 125–128.

   Google Scholar 

6. Goto S., I.Cederbaum and B.Ting, Suboptimal Solution of the Backboard Ordering with Channel Capacity Constraints, IEEE Trans Circuits and Systems, Nov 1977, pp 645–652.

   Google Scholar 

7. Han S. and S.Sahni, Layering Algorithms for Single Row Routing, University of Minnesota, Technical report, June 1984.

   Google Scholar 

8. Han S. and S. Sahni, Single Row Routing in Narrow Streets, IEEE Trans CAD, CAD-3, 3, 1984, pp 235–241.

   Google Scholar 

9. Han S. and S.Sahni, A Fast Algorithm for Single Row Routing, University of Minnesota, Technical report, Jan 1984.

   Google Scholar 

10. Holyer I., The NP-Completeness of Edge-Coloring, Siam J. Computing, Vol 10, No 4, Nov 1981, pp 718–720.

    Google Scholar 

11. Hopcroft J. and R.Karp, An n ^5/2 Algorithm for Maximum Matching in Bipartite Graphs, Siam J. Computing, 1973, pp 225–231.

    Google Scholar 

12. Horowitz E. and S. Sahni, Fundamentals of Computer Algorithms, Computer science press, Potomac, MD, 1978.

    Google Scholar 

13. Kuh E., T.Kashwabara and T.Fujisawa, On Optimal Single Row Routing, IEEE Trans Circuits and Systems, Vol CAS-26, No 6, June 1979.

    Google Scholar 

14. Raghavan R. and S. Sahni, Single Row Routing, IEEE Trans Computers, C-32, 3, 1983, pp 209–220.

    Google Scholar 

15. Raghavan R. and S. Sahni, The Complexity of Single Row Routing, IEEE Trans Circuits and Systems, CAS-31, 5, 1984, pp 462–472.

    Google Scholar 

16. So H.C., Some Theoritical Results on the Routing of Multilayer Printed Wiring Boards, Proc IEEE Symp Circuits and Systems, 1974, pp 296–303.

    Google Scholar 

17. Syslo M.M., N. Deo and J.S. Kowalik, Discrete Optimization Algorithms, Prentice Hall Inc, NJ, 1983.

    Google Scholar 

18. Tarng T., M. Marek-Sadowska and E.S. Kuh, An Efficient Single Row Routing Algorithm, IEEE Trans CAD, CAD-3, 3, 1984, pp 178–183.

    Google Scholar 

19. Ting B., E.S. Kuh and I. Shirakawa, The Multilayer Routing Problem: Algorithms and Necessary and Sufficient Conditions for the Single-Row Single-Layer Case, IEEE Trans Circuit and Systems, CAS-23, Dec. 1976, pp 768–778.

    Google Scholar 

20. Ting B.S. and E.S.Kuh, An Approach to the Routing of Multilayer Printed Circuit Boards, Proc IEEE Symp Circuits and Systems, 1978, pp 902–911.

    Google Scholar 

21. Ting B.S., E.S.Kuh and A.Sangiovanni-Vincentelli, Via Assignment Problem in Multilayer Printed Circuit Board, IEEE Trans Circuits and Systems, Vol CAS-26, Apr 79, pp 261–271.

    Google Scholar 

22. Tsukiyama S., I.Shirakawa and S.Asahara, An Algorithm for the Via Assignment Problem in Multilayer Backboard Wiring, IEEE Trans Circuits and Systems, Vol CAS-26, Jun 79, pp 369–377.

    Google Scholar 

23. Tsukiyama S., E.S.Kuh and I.Shirakawa, On the Layering Problem of Multilayer PWB Wiring, IEEE Trans CAD, CAD-2, 1, Jan 83, pp 30–38.

    Google Scholar 

Download references