Optimal wiring between rectangles

Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We consider the problem of wiring together two parallel rows of points under a variety of conditions. The options'include whether we allow the rows to slide relative to one another, whether we use only rectilinear wires or arbitrary wires, and whether we can use wires in one layer or several layers. In almost all of these combinations of conditions, we can provide a polynomial-time algorithm to minimize the distance between the parallel rows of points. We also compare two fundamentally different wiring approaches, where one and two layers are used. We show that although the theoretical model implies that there can be great gains for the two-layer strategy, even in cases where no crossovers are required, when we consider typical design rules for laying out VLSI circuits there is no substantial advantage to the two-layer approach over the one-layer approach.

Original languageEnglish (US)
Title of host publicationConference Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC 1981
PublisherAssociation for Computing Machinery
Number of pages6
ISBN (Print)0897910419
StatePublished - May 11 1981
Event13th Annual ACM Symposium on Theory of Computing, STOC 1981 - Milwaukee, United States
Duration: Jun 11 1981Jun 13 1981

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017


Other13th Annual ACM Symposium on Theory of Computing, STOC 1981
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Optimal wiring between rectangles'. Together they form a unique fingerprint.

Cite this