Mathematical Programming

, Volume 9, Issue 1, pp 31–56

Matroid intersection algorithms

  • Eugene L. Lawler
Article

Abstract

LetM1 = (E, 91),M2 = (E, 92) be two matroids over the same set of elementsE, and with families of independent sets 91, 92. A setI ∈ 91 ∩ 92 is said to be anintersection of the matroidsM1,M2. An important problem of combinatorial optimization is that of finding an optimal intersection ofM1,M2. In this paper three matroid intersection algorithms are presented. One algorithm computes an intersection containing a maximum number of elements. The other two algorithms compute intersections which are of maximum total weight, for a given weighting of the elements inE. One of these algorithms is “primal-dual”, being based on duality considerations of linear programming, and the other is “primal”. All three algorithms are based on the computation of an “augmenting sequence” of elements, a generalization of the notion of an augmenting path from network flow theory and matching theory. The running time of each algorithm is polynomial inm, the number of elements inE, and in the running times of subroutines for independence testing inM1,M2. The algorithms provide constructive proofs of various important theorems of matroid theory, such as the Matroid Intersection Duality Theorem and Edmonds' Matroid Polyhedral Intersection Theorem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. Edmonds, “Minimum partition of a matroid into independent subsets”,Journal of Research of the National Bureau of Standards 69B (1965) 67–72.Google Scholar
  2. [2]
    J. Edmonds and D.R. Fulkerson, “Transversals and matroid partition”,Journal of Research of the National Bureau of Standards 69B (1965) 147–153.Google Scholar
  3. [3]
    J. Edmonds, “Submodular functions, matroids and certain polyhedra”,Combinatorial structures and their applications, proceedings of the Calgary international conference (Gordon and Breach, New York, 1970) pp. 67–87.Google Scholar
  4. [4]
    J. Edmonds, “Matroids and the greedy algorithm”,Mathematical Programming 1 (1971) 127–136.Google Scholar
  5. [5]
    S. Kundu and E.L. Lawler, “A matroid generalization of a theorem of Mendelsohn and Dulmage”,Discrete Mathematics 4 (1973) 159–163.Google Scholar
  6. [6]
    W.T. Tutte,Introduction to the theory of matroids (American Elsevier, New York, 1971).Google Scholar
  7. [7]
    D.J.A. Welsh, “On matroid theorems of Edmonds and Rado”,Journal of the London Mathematical Society 45 (1970) 251–256.Google Scholar

Additional references

  1. [8]
    M. Aigner and T.A. Dowling, “Matching theory for combinatorial geometries”,Transactions of the American Mathematical Society 158 (1971) 231–245.Google Scholar
  2. [9]
    M. Iri and N. Tomizawa, “An algorithm for finding an optimal ‘independent assignment”, University of Tokyo, unpublished.Google Scholar
  3. [10]
    Stein Krogdahl, “A combinatorial proof for Lawler's Matroid Intersection Algorithm”, to appear.Google Scholar

Copyright information

© The Mathematical Programming Society 1975

Authors and Affiliations

  • Eugene L. Lawler
    • 1
  1. 1.University of CaliforniaBerkeleyUSA

Personalised recommendations