The Via Minimization Problem is NP-Complete

IEEE Transactions on Computers

Volumn 38, Issue 11, 1989, Pages 1604-1608

  Naclerio, Nicholas J ^a   Masuda, Sumio ^b   Nakajima, Kazuo ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b OSAKA UNIVERSITY   (Japan)

Author keywords

Layer assignment; layout; NP completeness; printed circuit board; routing; via minimization; VLSI

Indexed keywords

COMPUTER METATHEORY--COMPUTABILITY AND DECIDABILITY;

COMPUTATIONAL COMPLEXITY; CONSTRAINED OPTIMIZATION; LAYOUT; NP COMPLETENESS; ROUTING; VIA MINIMIZATION PROBLEM;

INTEGRATED CIRCUITS;

EID: 0024770040     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.42135     Document Type: Article

References (17)

1. K. C. Chang and D. H-C. Du, “Efficient algorithms for layer assignment problem,” IEEE Trans. Comput.-Aided Design, vol. CAD-6, no. 1, pp. 67–78, Jan. 1987.
2. R-W. Chen, Y. Kajitani, and S-P. Chan, “A graph-theoretic via minimization algorithm for two-layer printed circuit boards,” IEEE Trans. Circuits Syst., vol. CAS-30, no. 5, pp. 284–299, May 1983.
3. N. Chiba, T. Nishizeki, S. Abe, and T. Ozawa, “A linear time algorithm for embedding planar graphs using PQ-trees,” J. Comput. Syst. Sci., vol. 30, pp. 54–76, 1985.
4. M. J. Cielielski and E. Kinnen, “An optimum layer assignment for routing in ICs and PCBs,” in Proc. 18th Design Automat. Conf., Nashville, TN, June 1981, pp. 733–737.
5. I. Fary, “On straight line representation of planar graphs,” Acta Sci. Math. (Szeged), vol. 11, pp. 229–233, 1948.
6. M. R. Garey and D. S. Johnson, “The rectilinear Steiner tree problem is NP-complete,” SIAM J. Appl. Math., vol. 32, no. 4, pp. 826–834, June 1977.
7. M. R. Garey, D. S. Johnson, and L. Stockmeyer, “Some simplified NP-complete graph problems,” Theoret. Comput. Sci., vol. 1, pp. 237–267, 1976.
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
9. A. Hashimoto and J. Stevens, “Wire routing by optimizing channel assignment within large apertures,” in Proc. 8th Design Automat. Workshop, Atlantic City, NJ, June 1971, pp. 155–169.
10. C.-P. Hsu, “Minimum via topological routing,” IEEE Trans. Comput.-Aided Design, vol. CAD-2, no. 4, pp. 235–246, Oct. 1983.
11. Y. Kajitani, “On via hole minimization of routing on a 2-layer board,” in Proc. 1980 IEEE Int. Conf. Circuits Comput., Oct. 1980, pp. 295–298.
12. M. Marek-Sadowska, “An unconstrained topological via minimization problem for two-layer routing,” IEEE Trans. Comput.-Aided Design, vol. CAD-3, no. 3, pp. 184–190, July 1984.
13. P. Molitor, “On the contact minimization problem,” in Proc. 4th Annu. Symp. Theoret. Aspects Comput. Sci., Passau, West Germany, Feb. 1987, pp. 420–431.
14. N. J. Naclerio, S. Masuda, and K. Nakajima, “Via minimization for gridless layouts,” in Proc. 24th Design Automat. Conf., Miami Beach, FL, June 1987, pp. 159–165.
15. R. Y. Pinter, “Optimal layer assignment for interconnect,” in Proc. 1982 IEEE Int. Conf. Circuits Comput., New York, NY, Sept. 1982, pp. 398–401.
16. K. R. Stevens and W. M. VanCleemput, “Global via elimination in generalized routing environment,” in Proc. IEEE 1979 Int. Symp. Circuits Syst., Tokyo, Japan, June 1979, pp. 689–692.
17. R. Tamassia, “On embedding a graph in the grid with the minimum number of bends,” SIAM J. Comput., vol. 16, no. 3, pp. 421–444, June 1987.