An engineered branch-and-reduce solver with data reductions is orders of magnitude faster than an ILP on multiterminal cut, but a key reduction's proof has a serious gap.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Shared-Memory Branch-and-Reduce for Multiterminal Cuts
An engineered branch-and-reduce solver with data reductions is orders of magnitude faster than an ILP on multiterminal cut, but a key reduction's proof has a serious gap.