Abstract
We consider single row routing problems in VLSI. Previous work has left open, for all k≥3, whether or not there is an efficient algorithm to route interconnections on the minimum number of layers when only k channels are permitted per layer. We show that deciding whether such a routing exists is NP-complete even when k=3 and the interconnections are 2-pin nets. This solves an important open problem often cited in the literature. We also improve the running times of previously described algorithms for obtaining optimal single row routings by showing how to eliminate several paths in exhaustive search. Although this result still yields an exponential time algorithm (which presumably is necessary, as the problem is NP-complete), it solves routings instances with more channels than could be handled before.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Andersen, "On Single-Row Routing", IEEE Transactions on Circuits and Systems, vol CAS-27, no. 12, Dec. 1980, pp. 1262–1263.
P. Arnold, "Complexity Results for Circuit Layout on Double-sided printed circuit boards", Bachelor's thesis, Harvard University, 1982.
A. Dingle and H. Sudborough, "Single Row Routing Revisited", manuscript, University of Texas at Dallas, January 1989.
M. Garey and S. Johnson, Computers and Intractability, San Francisco, CA: Freeman, 1979, p. 199.
T. F. Gonzalez and S. Kurki-Gowdara, "Minimization of the Number of Layers for Single Row Routing with Fixed Street Capacity", IEEE Trans. Computer-Aided Design, vol 7, no. 3, March 1988, pp. 420–424.
S. Han, and S. Sahni, "Single-Row Routing in Narrow Streets", IEEE Transactions on Computer-Aided Design, vol CAD-3, no. 3, July 1984, pp. 235–241.
S. Han, and S. Sahni, "Layering Algorithms for Single Row Routing", in Proc. 22nd Design Automation Conf., 1985, pp. 516–522.
E. Kuh, T. Kashiwabara, and T. Fujisawa, "On Optimum Single-Row Routing", IEEE Transactions on Circuits and Systems, vol CAS-26, no. 6, June 1979, pp. 209–216.
M. Marek-Sadowska and T. Tarng, "Single-Layer Routing for VLSI: Analysis and Algorithms", IEEE Transactions on Computer-Aided Design, vol CAD-2, no. 4, Oct 1983, pp. 246–259.
R. Raghavan and S. Sahni, "Single Row Routing", IEEE Transactions on Computers, vol C-32, no. 3, March 1983, pp. 209–220.
D. Richards, "Complexity of Single-Layer Routing", IEEE Trans. Computers, vol C-33, no. 3, March 1984, pp. 286–288.
S. Sahni, A. Bhatt, and R. Raghavan, "The complexity of design automation problems", in Proc. 17th Design Automation Conf., 1980, pp. 402–411.
B. Ting, E. S. Kuh, and I. Shirakawa, "The Multilayer Routing Problem: Algorithms and Necessary and Sufficient Conditions for the Single-Row Single-Layer Case", IEEE Transactions on Circuits and Systems, vol CAS-23, no. 12, Dec 1976, pp. 768–778.
S. Tsukiyama, E. S. Kuh, and I. Shirakawa, "An Algorithm for Single-Row Routing with Prescribed Street Congestions", IEEE Transactions on Circuits and Systems, vol CAS-27, no. 9, Sept. 1980, pp. 765–772.
S. Tsukiyama, E. S. Kuh, and I. Shirakawa, "On the layering problem on multilayer PWB wiring", IEEE Trans. Computer-Aided Design, vol CAD-2, pp. 30–38, Jan 1983.
T. Tarng, M. Marek-Sadowska, and E. Kuh, "An Efficient Single-Row Routing Algorithm", IEEE Transactions on Computer-Aided Design, vol CAD-3, no. 3, July 1984, pp. 178–183.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dingle, A., Sudborough, I.H. (1989). On the complexity of single row routing problems. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_44
Download citation
DOI: https://doi.org/10.1007/3-540-51542-9_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51542-5
Online ISBN: 978-3-540-48237-6
eBook Packages: Springer Book Archive