On Min-Cut Algorithms for Half-Duplex Relay Networks

Raúl Etkin, Farzad Parvaresh, Ilan Shomorony +1

Computing the cut-set bound in half-duplex relay networks is a challenging optimization problem, since it requires finding the cut-set optimal half-duplex schedule. This subproblem…