Answers are grounded in this paper and cite their sources.
An algorithm is presented that, given N two-pin nets in a channel, finds, in O(N/sup 2/) time, the largest subset that can be routed all on one layer
No takes yet. Share an insight, caveat, or question.
Kenneth J. Supowit (1987) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: