Intersecting and dense restrictions of clutters in polynomial time

DOI10.1007/S10107-023-02034-3zbMATH Open1545.05035MaRDI QIDQ6589757FDOQ6589757

Authors: Martin Drees 

Publication date: 20 August 2024

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

Recommendations

• Intersecting and dense restrictions of clutters in polynomial time
• Intersecting restrictions in clutters
• Blocker size via matching minors
• Deltas, extended odd holes and their blockers
• A Class of Polynomially Solvable Set-Covering Problems

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

• Title not available (Why is that?)
• Bottleneck extrema
• The matroids with the max-flow min-cut property
• Ideal 0, 1 matrices
• On the width—length inequality
• The complexity of recognizing linear systems with certain integrality properties
• The Forbidden Minors of Binary Clutters
• Ideal clutters that do not pack
• Intersecting restrictions in clutters
• Zur allgemeinen Kurventheorie.
• Deltas, extended odd holes and their blockers
• Idealness of \(k\)-wise intersecting families

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

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