The paper's label-merging operation does not preserve minimum label cut values, so its central reduction and derived hardness results are unsupported.
”Approximating minimum label s-t cut via linear programming.” In Latin American Symposium on Theoretical Informatics, pp
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
-
The Landscape of Minimum Label Cut (Hedge Connectivity) Problem
The paper's label-merging operation does not preserve minimum label cut values, so its central reduction and derived hardness results are unsupported.