Incremental Timing-Driven Placement, problem C of ICCAD contest 2015

Problem website

This is the final project of Introduction to Electronic Design Automation at National Taiwan University, 2015 Spring

We implemented the method described in Timing-Driven Placement Based on Dynamic Net-Weighting for Efficient Slack Histogram Compression to deal with this problem.