Via Assignment in Single-Row Routing

Authors:
J. Bhasker;S. Sahni
Affiliations:
AT&T Bell Labs., Middletown, PA;Univ. of Minnesota, Minneapolis
Venue:
IEEE Transactions on Computers
Year:
1989

Citing 5
Cited 0

Discrete Optimization Algorithms with Pascal Programs

Discrete Optimization Algorithms with Pascal Programs
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Fundamentals of Computer Alori

Fundamentals of Computer Alori
Graph Theory With Applications

Graph Theory With Applications
On the Layering Problem of Multilayer PWB Wiring

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	14.98

Visualization

Abstract

Examines 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.