New partial optimality conditions for the preordering problem increase the fraction of pairs decidable as unrelated in an optimal preorder.
Since γij|1(x)ij = 1 for all x ∈ XV [ˆx], there is an optimal solu- tion x∗ to POPV,c[ˆx] such that x∗ ij = 1
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Partial Optimality in the Preordering Problem
New partial optimality conditions for the preordering problem increase the fraction of pairs decidable as unrelated in an optimal preorder.