Lov\'asz extension and graph cut
classification
🧮 math.CO
math.OCmath.SP
keywords
extensiongraphproblemsconstructcontinuousequivalentestablishedoptimization
read the original abstract
A set-pair Lov\'asz extension is established to construct equivalent continuous optimization problems for graph $k$-cut problems.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.