An Efficient Aopproach to Constrained Via Minimization for Two-Layer VLSI Routing

Maolin Tang, Kamran Eshraghian, Hon Nin CheungASP-DAC 1999 · OpenReview

Abstract

Constrained via minimization is the problem of reassigning wire segments of a VLSI routing so that the number of vias is minimized. In this paper, a new approach is proposed for two-layer VLSI routing. This approach is able to handle any types of routing, and allows arbitrary number of wire segments split at a via candidate.
BibTeX
@inproceedings{tang1999efficient,
  author = {Maolin Tang and Kamran Eshraghian and Hon Nin Cheung},
  title = {{An Efficient Aopproach to Constrained Via Minimization for Two-Layer VLSI Routing}},
  booktitle = {ASP-DAC},
  year = {1999},
  url = {https://openreview.net/forum?id=1r0tEOGgZ6},
}

Loading related content...

Figure