New partial optimality conditions for the preordering problem increase the fraction of pairs decidable as unrelated in an optimal preorder.
6.2 is fulfilled for every ij ∈ δ(U, V \ U) as c− ij ≥ X pq∈δ(U,V \U )\ˆx−1(0) c+ pq = 0
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.