Intersecting and dense restrictions of clutters in polynomial time

DOI10.1007/978-3-031-06901-7_16MaRDI QIDQ2164697zbMATH OpenOpenAlexFDO

Authors Martin Drees

Publication date 16 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-06901-7_16

zbMATH Keywords

odd holesdeltascluttersclutter minors

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 16724 (Why is no real title available?)
• Bottleneck extrema
• Deltas, extended odd holes and their blockers
• Ideal 0, 1 matrices
• Ideal clutters that do not pack
• Idealness of \(k\)-wise intersecting families
• Intersecting restrictions in clutters
• On the width—length inequality
• The Forbidden Minors of Binary Clutters
• The complexity of recognizing linear systems with certain integrality properties
• The matroids with the max-flow min-cut property

Cited in

(5)

• A tight lower bound for the hardness of clutters
• Intersecting and dense restrictions of clutters in polynomial time
• Minimizing clutter using absence in Venn-\(\text i^{\text e}\)
• Intersecting restrictions in clutters
• Deltas, extended odd holes and their blockers

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