1 paper
Adil Chhabra, Christian Schulz, Bora Uçar +1
The hypergraph minimum cut problem aims to partition its vertices into two blocks while minimizing the total weight of the cut hyperedges. This fundamental problem arises in networ…