Eine Min-Max Beziehung für das Exakte Matroid Problem. (A min-max relation for the exact matroid problem)

DOI10.1007/BF01200471zbMath0606.05018OpenAlexW2085294528MaRDI QIDQ1084400

Matthias Leclerc

Publication date: 1987

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01200471

zbMATH Keywords

exact matroid problemmatroid polytope of Edmonds and Gilestotal dual integral system

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Edmonds polytopes and a hierarchy of combinatorial problems
• Efficient algorithms for a family of matroid intersection problems
• Paths, Trees, and Flowers

This page was built for publication: Eine Min-Max Beziehung für das Exakte Matroid Problem. (A min-max relation for the exact matroid problem)