“…For the symmetry constraints, the symmetric-feasible conditions have been extensively studied in many topological representations, including sequence pairs (SP) [1], O-trees [10], binary trees [2], transitive closure graphs (TCG) [4], corner block lists (CBL) [8], and B*-trees [6]. In addition to the symmetry constraint, many other analog or general placement constraints, including boundary, commoncentroid, minimum/maximum-distance, pre-placement, proximity/range, regularity, symmetry-island, and thermal constraints, were also investigated in the recent works [3,5,6,7,8,9,11,14,12] 1 using the B*-tree, CBL, and SP representations, which are summarized in Table 1. During placement optimization, most of the recent works applied the simulated annealing algorithm [15], except [11] which is based on a non-stochastic approach.…”