Answers are grounded in this paper and cite their sources.
Based on graph theory, a study of via minimization problem is presented. We show that the simplest problem of this type is NP-complete and propose a heuristic algorithm for topological via minimization.
No takes yet. Share an insight, caveat, or question.
Malgorzata Marek-Sadowska (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: