A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Augmented Sparsifiers for Generalized Hypergraph Cuts with Applications to Decomposable Submodular Function Minimization
[article]
2021
arXiv
pre-print
In recent years, hypergraph generalizations of many graph cut problems have been introduced and analyzed as a way to better explore and understand complex systems and datasets characterized by multiway relationships. Recent work has made use of a generalized hypergraph cut function which for a hypergraph ℋ = (V,E) can be defined by associating each hyperedge e ∈ E with a splitting function w_e, which assigns a penalty to each way of separating the nodes of e. When each w_e is a submodular
arXiv:2007.08075v2
fatcat:3zxg6oro6fgi3mpa5656lh7hgi