Intersecting and dense restrictions of clutters in polynomial time

DOI10.1007/s10107-023-02034-3zbMATH Open1545.05035MaRDI QIDQ6589757

Martin Drees

Publication date: 20 August 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

odd holesdeltascluttersclutter minors

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• The complexity of recognizing linear systems with certain integrality properties
• The matroids with the max-flow min-cut property
• Ideal 0, 1 matrices
• Zur allgemeinen Kurventheorie.
• Idealness of \(k\)-wise intersecting families
• Deltas, extended odd holes and their blockers
• Intersecting restrictions in clutters
• On the width—length inequality
• The Forbidden Minors of Binary Clutters
• Ideal Clutters That Do Not Pack
• Bottleneck extrema

This page was built for publication: Intersecting and dense restrictions of clutters in polynomial time