Lovász extension and graph cut (Q2057034)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lovász extension and graph cut |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lovász extension and graph cut |
scientific article |
Statements
Lovász extension and graph cut (English)
0 references
8 December 2021
0 references
The Lovász extension provides a way to find an equivalent continuous optimization problem formulation for discrete and combinatorial problems. The authors extend this concept and apply it to the graph \(k\)-cut (in particular dual Cheeger cut) problem. They give an equivalent continuous formulation of the 3-cut problem and provide an approach to the general \(k\)-cut problem.
0 references
Lovász extension
0 references
submodular function
0 references
Cheeger cut
0 references
max cut
0 references
graph cut
0 references
