Clutter
A clutter is a set family with no member containing another member. In other context, they are also called Sperner families.
Let C be a clutter on ground set V. We investigate the following linear system LP(C) associated with C:
minwx: x(v)≥0 for each v∈V,x(A)≥1 for each A∈C
- A clutter C packs if both LP(C) and its dual have integral optimal solutions for w=1.
- A clutter C has the packing property if both LP(C) and its dual have integral optimal solutions if w∈{0,1,+∞}V.
- A clutter C has the max flow min cut property (MFMC property for short) if both LP(C) and its dual have integral optimal solutions if w∈ZV+. Equivalently, if LP(C) is TDI.
- A clutter C is ideal if LP(C) has an integral optimal solution if w∈ZV+. Equivalently, if LP(C) describes an integer polyhedron.
The blocker of a clutter is the clutter of inclusionwise minimal transversals. Given a clutter C and an element v∈V, the deletion of v means the restriction of the clutter to V−v, while the contraction of v is the clutter on ground set V−v formed by the inclusionwise minimal elements of {X−v:X∈C}. A minor of C is a clutter obtained by a sequence of deletions and contractions.
A comprehensive description on the topic can be found in Cornuéjols' book [1]. See also the Wikipedia article.
References
- ↑ G. Cornuéjols, Combinatorial Optimization: Packing and Covering, author link