Polynomial-time algorithm verifies minimum-weight matroid basis under general uncertainty areas including finite sets and interval unions, generalizing prior open-interval results.
The corresponding condition of Lemma 18 isFe⊆Qor ˆFe +e⊆Q
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Optimal Verification of a Minimum-Weight Basis in an Uncertainty Matroid
Polynomial-time algorithm verifies minimum-weight matroid basis under general uncertainty areas including finite sets and interval unions, generalizing prior open-interval results.