Integer Programming and Combinatorial Optimization

A clutter (V, E) packs if the smallest number of vertices needed to intersect all the edges (i.e. a transversal) is equal to the maximum number of pairwise disjoint edges (i.e. a matching). This terminology is due to Seymour 1977. A clutter is minimally nonpacking if it does not pack but all its minors pack. A 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.

[1]  Alan M. Frieze,et al.  Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach , 1999, Random Struct. Algorithms.

[2]  Clifford Stein,et al.  Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs ( Extended Abstract ) , 1998 .

[3]  Éva Tardos,et al.  Fast approximation algorithms for fractional packing and covering problems , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4]  Martin Skutella,et al.  Random-Based Scheduling: New Approximations and LP Lower Bounds , 1997, RANDOM.

[5]  Aravind Srinivasan,et al.  Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[6]  Alexander Schrijver,et al.  Homotopic routing methods , 1990 .

[7]  Serge A. Plotkin.  Competitive Routing of Virtual Circuits in ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[8]  Richard M. Karp,et al.  Global wire routing in two-dimensional arrays , 1987, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[9]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[10]  Aravind Srinivasan,et al.  A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria , 2000, SIAM J. Comput..

[11]  David B. Shmoys,et al.  A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.

[12]  Martin Skutella,et al.  Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria , 1997, ESA.

[13]  Richard M. Karp,et al.  On the Computational Complexity of Combinatorial Problems , 1975, Networks.

[14]  George L. Nemhauser,et al.  One-machine generalized precedence constrained scheduling problems , 1994, Oper. Res. Lett..

[15]  Yuval Rabani,et al.  Improved bounds for all optical routing , 1995, SODA '95.

[16]  Colin Cooper,et al.  The Threshold for Hamilton Cycles in the Square of a Random Graph , 1994, Random Struct. Algorithms.

[17]  Paul Erdös,et al.  Optima of dual integer linear programs , 1988, Comb..

[18]  H. Fleischner.  The square of every two-connected graph is Hamiltonian , 1974 .

[19]  David B. Shmoys,et al.  Improved approximation algorithms for shop scheduling problems , 1991, SODA '91.

[20]  Aravind Srinivasan,et al.  Improved approximations of packing and covering problems , 1995, STOC '95.

[21]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[22]  Clifford Stein,et al.  Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[23]  Clifford Stein,et al.  Approximation algorithms for multicommodity flow and shop scheduling problems , 1992 .

[24]  Jon M. Kleinberg,et al.  Single-source unsplittable flow , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[25]  Steven Skiena,et al.  Algorithms for Square Roots of Graphs , 1991, SIAM J. Discret. Math..

[26]  Ronitt Rubinfeld,et al.  Short paths in expander graphs , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[27]  Éva Tardos,et al.  Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[28]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[29]  Aravind Srinivasan,et al.  An extension of the Lovász local lemma, and its applications to integer programming , 1996, SODA '96.