“…As for graph-based approaches, Zhang et al proposed a weighted generational solving algorithm based on graph growing and a specific backtracking strategy to solve the simultaneous template optimization and mask assignment problem. 7 Badr et al proposed a two-stage heuristic method that scales to dense full-chip designs. 8 They assumed that maximizing the chance of grouping can maximize the possibility of being able to fix conflicts by DSA grouping.…”