New partial optimality conditions for the preordering problem increase the fraction of pairs decidable as unrelated in an optimal preorder.
Thus, for every pq ∈ P ′′ 01 we have that xpq − x′ pq ∈ {0, −1}, and for every pq ∈ P ′′ 10 we have that xpq − x′ pq ∈ {0, 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.