Matroid Intersection

In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set. If the elements of the matroid are assigned real weights, the weighted matroid intersection problem is to find a common independent set with the maximum possible weight. These problems generalize many problems in combinatorial optimization including finding maximum matchings and maximum weight matchings in bipartite graphs and finding arborescences in directed graphs.

The matroid intersection theorem, due to Jack Edmonds,. Reprinted in M. Jünger et al. (Eds.): Combinatorial Optimization (Edmonds Festschrift), LNCS 2570, pp. 1126, Springer-Verlag, 2003. says that there is always a simple upper bound certificate, consisting of a partitioning of the ground set amongst the two matroids, whose value (sum of respective ranks) equals the size of a maximum common independent set. Based on this theorem, the matroid intersection problem for two matroids can be solved in polynomial time using matroid partitioning algorithms.

Examples

Let ''G'' = (''U'',''V'',''E'') be a bipartite graph. One may define a partition matroid ''M_U'' on the ground set ''E'', in which a set of edges is independent if no two of the edges have the same endpoint in ''U''. Similarly one may define a matroid ''M_V'' in which a set of edges is independent if no two of the edges have the same endpoint in ''V''. Any set of edges that is independent in both ''M_U'' and ''M_V'' has the property that no two of its edges share an endpoint; that is, it is a matching. Thus, the largest common independent set of ''M_U'' and ''M_V'' is a maximum matching in ''G''.

Similarly, if each edge has a weight, then the maximum-weight independent set of ''M_U'' and ''M_V'' is a Maximum weight matching in ''G''.

Algorithms

There are several polynomial-time algorithms for weighted matroid intersection, with different run-times. The run-times are given in terms of $n$ - the number of elements in the common base-set, $r$ - the maximum between the ranks of the two matroids, $T$ - the number of operations required for a circuit-finding oracle, and $k$ - the number of elements in the intersection (in case we want to find an intersection of a specific size $k$).

* Edmonds' algorithm uses linear programming and polyhedra.
* Lawler's algorithm.
* Iri and Tomizawa's algorithm
* Andras Frank's algorithm uses $O(n ^3 T)$ arithmetic opreations.
* Orlin and Vande-Vate's algorithm.
* Cunningham's algorithm requires $O(r^n T)$ operations on general matroids, and $O(n r^ \log)$ operations on linear matroid, for two ''r''-by-''n'' matrices.
* Brezovec, Cornuejos and Glover present two algorithms for weighted matroid intersection.
** The first algorithm requires that all weights be integers, and finds an intersection of cardinality $k$ in time $O((n^3 k^2 + n k T)\cdot(1+\log))$.
** The second algorithm runs in time $O(n r \cdot (\log+r+T))$.
* Huang, Kakimura and Kakiyama show that the weighted matroid intersection problem can be solved by solving ''W'' instances of the unweighted matroid intersection problem, where ''W'' is the largest given weight, assuming that all given weights are integral. This algorithm is faster than previous algorithms when ''W'' is small. They also present an approximation algorithm that finds an ''e''-approximate solution by solving $O(\epsilon^\log )$ instances of the unweighted matroid intersection problem, where ''r'' is the smaller rank of the two input matroids.
* Ghosh, Gurjar and Raj study the run-time complexity of matroid intersection in the parallel computing model.
* Berczi, Kirali, Yamaguchi and Yokoi present strongly polynomial-time algorithms for weighted matroid intersection using more restricted oracles.

Extensions

Maximizing weight subject to cardinality

In a variant of weighted matroid intersection, called "(P_k)", the goal is to find a common independent set with the maximum possible weight among all such sets with cardinality ''k'', if such a set exists. This variant, too, can be solved in polynomial time.

Three matroids

The matroid intersection problem becomes NP-hard when three matroids are involved, instead of only two.

One proof of this hardness result uses a reduction from the Hamiltonian path problem in directed graphs. Given a directed graph ''G'' with ''n'' vertices, and specified nodes ''s'' and ''t'', the Hamiltonian path problem is the problem of determining whether there exists a simple path of length ''n'' − 1 that starts at ''s'' and ends at ''t''. It may be assumed without loss of generality that ''s'' has no incoming edges and ''t'' has no outgoing edges. Then, a Hamiltonian path exists if and only if there is a set of ''n'' − 1 elements in the intersection of three matroids on the edge set of the graph: two partition matroids ensuring that the in-degree and out-degree of the selected edge set are both at most one, and the graphic matroid of the undirected graph formed by forgetting the edge orientations in ''G'', ensuring that the selected edge set has no cycles.

Matroid parity

Another computational problem on matroids, the matroid parity problem, was formulated by Lawler as a common generalization of matroid intersection and non-bipartite graph matching. However, although it can be solved in polynomial time for linear matroids, it is NP-hard for other matroids, and requires exponential time in the matroid oracle model.

Valuated matroids

A valuated matroid is a matroid equipped with a value function ''v'' on the set of its bases, with the following ''exchange property'': for any two distinct bases $A$ and $B$, if $a\in A\setminus B$, then there exists an element $b\in B\setminus A$ such that both $(A \setminus \) \cup \$ and $(B \setminus \) \cup \$ are bases, and :$v(A)+v(B) \leq v(B \setminus \ \cup \) + v(A \setminus \ \cup \)$.

Given a weighted bipartite graph ''G'' = (''X''+''Y'', ''E'') and two valuated matroids, one on ''X'' with bases set ''B_X'' and valuation ''v_X'', and one on ''Y'' with bases ''B_Y'' and valuation ''v_Y'', the valuated independent assignment problem is the problem of finding a matching ''M'' in ''G'', such that ''M_X'' (the subset of ''X'' matched by ''M'') is a base in ''B_X'' , ''M_Y'' is a base in ''B_Y'' , and subject to this, the sum $w(M) + v_X(M_X)+v_Y(M_Y)$ is maximized. The weighted matroid intersection problem is a special case in which the matroid valuations are constant, so we only seek to maximize $w(M)$ subject to ''M_X'' is a base in ''B_X'' and ''M_Y'' is a base in ''B_Y'' ''.'' Murota presents a polynomial-time algorithm for this problem.

See also

* Matroid partitioning - a related problem.

References

Further reading

*.
*.
*{{citation, last1=Gabow, first1=Harold N., author1-link = Harold N. Gabow, last2=Tarjan, first2=Robert E., author2-link=Robert Tarjan, title=Efficient algorithms for a family of matroid intersection problems, journal=Journal of Algorithms, doi=10.1016/0196-6774(84)90042-7, volume=5, issue=1, year=1984, pages=80–131..

Combinatorial optimization
Intersection