### Abstract

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 language | English (US) |
---|---|

Title of host publication | Conference Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC 1981 |

Publisher | Association for Computing Machinery |

Pages | 312-317 |

Number of pages | 6 |

ISBN (Print) | 0897910419 |

DOIs | |

State | Published - May 11 1981 |

Event | 13th Annual ACM Symposium on Theory of Computing, STOC 1981 - Milwaukee, United States Duration: Jun 11 1981 → Jun 13 1981 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|

ISSN (Print) | 0737-8017 |

### Other

Other | 13th Annual ACM Symposium on Theory of Computing, STOC 1981 |
---|---|

Country | United States |

City | Milwaukee |

Period | 6/11/81 → 6/13/81 |

### Fingerprint

### ASJC Scopus subject areas

- Software

### Cite this

*Conference Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC 1981*(pp. 312-317). (Proceedings of the Annual ACM Symposium on Theory of Computing). Association for Computing Machinery. https://doi.org/10.1145/800076.802484