A (1-ε)-approximation algorithm for linear matroid intersection (and its weighted version) achieves Õ_ε(nnz(M1) + nnz(M2) + r_* ^ω) time, improving on prior exact and approximate algorithms.
38 Claude-Pierre Jeannerod, Clément Pernet, and Arne Storjohann
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Faster Approximate Linear Matroid Intersection
A (1-ε)-approximation algorithm for linear matroid intersection (and its weighted version) achieves Õ_ε(nnz(M1) + nnz(M2) + r_* ^ω) time, improving on prior exact and approximate algorithms.