scientific article; zbMATH DE number 26304

MaRDI QIDQ3984504zbMATH OpenFDO

Authors Peter Bachmann

Publication date 27 June 1992

zbMATH Keywords

\(m\)-matroid-intersection-problemapproximation algorithmcombinatorial optimizationintersection algorithmsoptimal solutionworst-case bound

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Recommendations

• Efficient algorithms for a family of matroid intersection problems
• Exact and approximation algorithms for weighted matroid intersection
• Exact and approximation algorithms for weighted matroid intersection
• Approximate multi-matroid intersection via iterative refinement
• Approximate multi-matroid intersection via iterative refinement
• Efficient theoretic and practical algorithms for linear matroid intersection problems
• Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
• A Fast Approximation for Maximum Weight Matroid Intersection
• Approximation by lexicographically maximal solutions in matching and matroid intersection problems
• scientific article; zbMATH DE number 4068895

Cited in

(8)

• Fast approximation of matroid packing and covering
• The matroid intersection cover problem
• scientific article; zbMATH DE number 5888307 (Why is no real title available?)
• scientific article; zbMATH DE number 3904606 (Why is no real title available?)
• scientific article; zbMATH DE number 4068895 (Why is no real title available?)
• scientific article; zbMATH DE number 1138274 (Why is no real title available?)
• A Fast Approximation for Maximum Weight Matroid Intersection
• scientific article; zbMATH DE number 1839479 (Why is no real title available?)

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 Q3984504)