Abstract
We examine the via assignment problem that arises when the single row routing approach to the interconnection problem is used. Some new complexity results and two new heuristics are obtained. Experimental results establish the superiority of the new heuristics over earlier ones.
Author supplied keywords
Cite
CITATION STYLE
APA
Bhasker, J., & Sahni, S. (1986). Via assignment in single row routing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 241 LNCS, pp. 154–176). Springer Verlag. https://doi.org/10.1007/3-540-17179-7_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free