Answers are grounded in this paper and cite their sources.
Gridless Gap Channel Routing (GGCR) is a routing problem defined in a critical routing layer in an advanced chip where a single horizontal trunk Steiner tree connects each net. The trunk widths are not unique, and trunks are allocated to partitioned routing areas, called gaps, without overlap. This paper proposes criticality-based ceiling and packing (CCAP) for GGCR to shorten the wirelength. CCAP routes a net with a smaller wirelength as much as possible by considering the congestion of gaps and the criticality of nets in terms of wirelength.
No takes yet. Share an insight, caveat, or question.
Shimoda et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: