English

Lov\'asz extension and graph cut

Combinatorics 2021-05-07 v3 Optimization and Control Spectral Theory

Abstract

A set-pair Lov\'asz extension is established to construct equivalent continuous optimization problems for graph kk-cut problems.

Keywords

Cite

@article{arxiv.1803.05257,
  title  = {Lov\'asz extension and graph cut},
  author = {Kung-Ching Chang and Sihong Shao and Dong Zhang and Weixi Zhang},
  journal= {arXiv preprint arXiv:1803.05257},
  year   = {2021}
}
R2 v1 2026-06-23T00:52:51.243Z