On the connectivity preserving minimum cut problem
We study an important generalization of the minimum cut problem (CPMC). We proved several important hardness results for the CPMC problem. We proved that planar CPMEC is in P.
connectivity preserving minimum cut inapproximability