Searching for "The Via Minimization Problem is NP-Complete." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

On the k-Layer Planar Subset and Topological Via Minimization Problems
by Jingsheng Jason Cong, C. L. Liu — 1991 — IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
… minimization problem are NP-complete. Moreover, we show that both problems can be solved in polynomial time…
Cited by 7 (3 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB