The claimed equality between minimum breaks and minimum odd cycle transversal is false as stated because the auxiliary graph omits the final round.
Improved approx imation algorithms for maximum cut and satisfiability problems using semidefinite p rogramming
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Minimizing breaks by minimizing odd cycle transversals
The claimed equality between minimum breaks and minimum odd cycle transversal is false as stated because the auxiliary graph omits the final round.