scientific article; zbMATH DE number 1555984

MaRDI QIDQ4525757zbMATH OpenFDO

Authors Ying Xu, Harold N. Gabow

Publication date 24 January 2001

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Recommendations

• Efficient theoretic and practical algorithms for linear matroid intersection problems
• Two algorithms for weighted matroid intersection
• Exact and approximation algorithms for weighted matroid intersection
• Efficient algorithms for a family of matroid intersection problems
• A Fast Approximation for Maximum Weight Matroid Intersection

Cited in

(11)

• Efficient theoretic and practical algorithms for linear matroid intersection problems
• A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices
• A fast algorithm to construct a representation for transversal matroids
• Faster Algorithms to Enumerate Hypergraph Transversals
• Efficient algorithms for a family of matroid intersection problems
• scientific article; zbMATH DE number 3904590 (Why is no real title available?)
• A time expanded matroid algorithm for finding optimal dynamic matroid intersections
• A Fast Approximation for Maximum Weight Matroid Intersection
• Fast Combinatorial Algorithm for Tightly Separating Hyperplanes
• Fast greedy for linear matroids
• Fast algorithms via dynamic-oracle matroids

This page was built for publication:

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