Abstract
The via minimization problem for a three-layer environment is studied, concentrating on the constrained via minimization (CVM3) problem. It is shown that the CVM3 problem is NP-complete, and a heuristic algorithm is proposed. The experimental results show that the algorithm is efficient and generates fairly good solutions.
| Original language | English (US) |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE |
| Pages | 274-277 |
| Number of pages | 4 |
| ISBN (Print) | 0818608021 |
| State | Published - Dec 1 1987 |