Lovász extension and graph cut

Kung-Ching Chang, Sihong Shao, Dong Zhang +1

A set-pair Lovász extension is established to construct equivalent continuous optimization problems for graph $k$-cut problems.