Fig. 11
From: Machine learning optimal ordering in global routing problems in semiconductors
Routing result \(S^k\) for a \(k=2\) layer routing environment with \(N_{\text {nets}}=3\). The vertices \(v_m^k\) that corresponding to pins are highlighted in orange and are restricted to a constant number of 15 per layer. The 1-layer routing solution \(S^1\) was obtained through the Steiner tree algorithm.
