Reducing logic depth during FPGA technology mapping can leave fanout bottlenecks in the resulting LUT network. LUT replication redistributes these loads but consumes area and increases loading on shared fanins. We propose FAPO, a mapper-independent post-mapping optimizer that jointly refines sink assignments and LUT cuts under a final-area constraint. It evaluates replication, cut switching, and recovery by the resulting live LUT count and full-network timing. A necessary all-critical-path condition motivates minimum-cut proposals that complement greedy refinement. Within a fixed critical graph and a restricted same-cut action family, each proposal minimizes the number of copy actions needed to cover all current critical paths. Experiments on EPFL benchmarks show that FAPO reduces the geometric-mean fanout-aware area-timing product (ATP) by up to 14.48% with only a small increase in area. VPR evaluation gives a 6.82% geometric-mean routed-delay reduction relative to ABC if.

翻译：暂无翻译