Faster Global Minimum Cut with Predictions

Benjamin Moseley, Helia Niaparast, Karan Singh

Global minimum cut is a fundamental combinatorial optimization problem with wide-ranging applications. Often in practice, these problems are solved repeatedly on families of simila…