Fault Tolerant Max-Cut

Keren Censor-Hillel, Noa Marelly, Roy Schwartz +1

In this work, we initiate the study of fault tolerant Max Cut, where given an edge-weighted undirected graph $G=(V,E)$, the goal is to find a cut $S\subseteq V$ that maximizes the…