Fast greedy for linear matroids

DOI10.1137/1.9781611975482.32MaRDI QIDQ5236213zbMATH OpenOpenAlexFDO

Authors

Publication date 15 October 2019

Published in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975482.32

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Analysis of algorithms (68W40)

Recommendations

• An algebraic algorithm for weighted linear matroid intersection
• On the generality of the greedy algorithm for solving matroid base problems
• scientific article; zbMATH DE number 1555984
• Efficient theoretic and practical algorithms for linear matroid intersection problems
• A framework for the greedy algorithm

Cited in

(4)

• Matroid representation of clique complexes
• Matroid representation of clique complexes
• A note on k-limited maximum base
• scientific article; zbMATH DE number 7204284 (Why is no real title available?)

This page was built for publication: Fast greedy for linear matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236213)