Via assignment in single row routing [chapter]

Jayaram Bhasker, Sartaj Sahni
1986 Lecture Notes in Computer Science  
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.
doi:10.1007/3-540-17179-7_10 fatcat:zlxr7ze3cfcnfct3mr25yyedme