Abstract.
A clutter (V, E) packs if the smallest number of vertices needed to intersect all the edges (i.e. a minimum transversal) is equal to the maximum number of pairwise disjoint edges (i.e. a maximum matching). This terminology is due to Seymour 1977. A clutter is minimally nonpacking if it does not pack but all its minors pack. An m×n 0,1 matrix is minimally nonpacking if it is the edge-vertex incidence matrix of a minimally nonpacking clutter. Minimally nonpacking matrices can be viewed as the counterpart for the set covering problem of minimally imperfect matrices for the set packing problem. This paper proves several properties of minimally nonpacking clutters and matrices.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: December 1, 1997 / Accepted: April 6, 1999¶Published online October 18, 2000
Rights and permissions
About this article
Cite this article
Cornuéjols, G., Guenin, B. & Margot, F. The packing property. Math. Program. 89, 113–126 (2000). https://doi.org/10.1007/PL00011389
Issue Date:
DOI: https://doi.org/10.1007/PL00011389