Lovász extension and graph cut
A set-pair Lovász extension is established to construct equivalent continuous optimization problems for graph $k$-cut problems.
math.CO↗
arXiv subjects
Kung-Ching Chang
Publications and source records attributed to Kung-Ching Chang.