Lecture 31: Min-cut placement

This video will discuss routing congestion and the min-cut placement algorithm. It also discusses examples of min-cut placement algorithms using Kerninghan-Lin(KL) and Fiduccia-Matheyyesses(FM) algorithms(partitioning algorithms).