HeiCut combines exact hypergraph reductions with a relaxed binary integer program to compute near-optimal minimum cuts in large hypergraphs, reporting exact cuts on over 85% of tested instances.
T he SAT C ompetition 2014
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Near-Optimal Minimum Cuts in Hypergraphs at Scale
HeiCut combines exact hypergraph reductions with a relaxed binary integer program to compute near-optimal minimum cuts in large hypergraphs, reporting exact cuts on over 85% of tested instances.