A matroid m consists of a set e and the family of subsets of e that satisfy a certain property called independence. At the same time, this shows the limitation of the use of matroids. 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. In this chapter, after giving some examples of matroid intersection, we show that that. A parameterized view on matroid optimization problems.
I saw some papers in which both mengers theorem and matroids appear in the title, but on the first glance they deal with usual cyclescuts graph matroids. New algorithms for linear kmatroid intersection and. Thus the ecient nc algorithms for matroid intersection and matroid parity are very useful. And the largest common independent set to i a and i b corresponds to a. It is the dual operation of a much more actively studied object, the matroid union see for example oxl11, chapter 11. For these two linear programs, kiraly and makai 15 showed the following integral. E, where x the set of lines in the arrangement y the set of convex chains x. Perhaps, the most famous example of matroid intersection. The concept of mconvex function, introduced by murota 1996, is a quantitative generalization of the set of integral points in an integral base polyhedron as well as an extension of valuated matroid of dress. A fast approximation for maximum weight matroid intersection.
The independent assignment problem or the weighted matroid intersection problem is extended using dress and wenzels matroid valuations, which are attached to the vertex set of the underlying bipartite. D thesis fairly recently on algorithms for matroid problems and also looked at submodular function optimization which generalizes matroid problems. Matroid intersection algorithm file exchange matlab. Here we investigate these problems from the parameterized complexity point of view. Weighted matroid intersection algorithm 333 the main consequence of the algorithm is a min max theorem on the maximum weight sk of a kelement common independent set. A characterization is presented for how the solution changes when one element changes in cost. Matroid optimization problems with monotone monomials in the. Matroid intersection algorithm file exchange matlab central. Lecture notes on matroid optimization march 20th, 2009 4 as a special case of the theorem, consider a graphic matroid. Find the matroid intersection between matroids fromed by columns of s1 and s2 using krogdahl graph. Consider the following linear program and its dual. In this paper three matroid intersection algorithms are presented. The intersect highresolution reservoir simulator is the answer to many of your reservoir challenges.
Introduction in this paper, we present new algorithms for the k matroid intersection problem and for the matroid kparity problem when k 2 and the given matroids are represented over the field of rational numbers. Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomialtime algorithms. The independent assignment problem or the weighted matroid intersection problem is extended using dress and wenzels matroid valuations, which are attached to the vertex set of the underlying bipartite graph as an additional weighting. Indeed, each so called independence system can be expressed as the intersection of finitely many matroids 52, 60. Much the same way, matroids yield easy instances of optimization in. My main focus was on matroid theory, in particular connectivity functions, and structural and algorithmic aspects of matroids representable over finite fields. Aug 26, 2014 there is a limited number of known optimization problems which are matroids, usually we have an intersection of matroids.
This matroid construction is a key tool in the development of our new results. The problem just described is an example of a matroid intersection problem. Recent developments in combinatorial optimization microsoft. Matroid optimization problems with monotone monomials in. New algorithms for linear kmatroid intersection and matroid. Jul 17, 2015 his areas of research span convex optimization, linear programming, spectral graph theory and algorithmic graph theory. A large bibliography of matroid papers, matroid software, and links. It is the dual operation of a much more actively studied object, the.
Multiintersection optimization matthew hausknecht, tszchiu au, and peter stone department of computer science the university of texas at austin austin, tx. A weighted matroid intersection algorithm sciencedirect. Nonlinear optimization for matroid intersection and extensions. Jan 21, 2016 in the past several years, there has been a lot of progress on combinatorial optimization. Industrial engineering ie software including the neos server. Matroid optimization problems are wellunderstood in the linear case and arise as substructures in many other combinatorial optimization problems. Letm 1 e, 91,m 2 e, 92 be two matroids over the same set of elementse, and with families of independent sets 91, 92. Industrial engineering ie software for roadway intersection planning and design. Computational geometry and parametric matroid optimization. Matroids have found applications in geometry, topology, combinatorial optimization, network theory and coding theory. The core driver of cunninghams algorithm is a subrou tine that we refer to as. Operators can simulate detailed geological features and quantify uncertainties, by creating accurate production scenarios and, with the integration of precise models of the surface facilities and field operations, the intersect simulator produces reliable results which are constantly updated. Data structures are given for updating the solution online each time the cost of an arbitrary matroid element is modified. If we add an edge to a forest and the resulting graph has a cycle then it has a unique.
A fast algorithm is given for solving such matroid intersection problems when d is small. E is the base set, option1,2 for the case s1 is a numerical matrix, and s2 is a structured matrix, which is the default option. The notion of matroid intersection seems to have gotten very little attention from matroid theorists. Introduction in this paper, we present new algorithms for the kmatroid intersection problem and for the matroid k. In the past several years, there has been a lot of progress on combinatorial optimization. However, several natural matroid problems, such as 3.
Matroid intersection in combinatorial optimization, the matroid intersection problem is to find a largest common. Franksalgorithmfra81issimpler,andisfoundedonthefollowing basicobservation. The reader unfamiliar with matroids should consult 6,9 or 7. Linear and integer, and their applications to compressed sensing, data mining, and pattern classification. Mconvex function on generalized polymatroid mathematics. Lecture notes on matroid intersection one nice feature about matroids is that a simple greedy algorithm allows to optimize over its independent sets or over its bases. The weighted matroid intersection problem consists of finding a seti. As an integer program, the problem can be formulated as follows. Matroid intersection algorithm how is matroid intersection.
Keywordsnonlinear combinatorial optimization matroid optimization highperformance computinghighprecision linear algebra mathematics subject classification 2000900890c2790c26 view show abstract. Nonlinear optimization for matroid intersection and. In the weighted matroid intersection problem, we are given two matroids. Letm 1 e, 9 1,m 2 e, 9 2 be two matroids over the same set of elementse, and with families of independent sets 9 1, 9 2. Matroid theory borrows extensively from the terminology of linear algebra and graph theory, largely because it is the abstraction of various notions of central importance in these fields. Lecture notes on matroid intersection may 2, 2017 2 now observe that any f2i a\i b corresponds to a matching in g, and vice versa. But avoid asking for help, clarification, or responding to other answers. Using techniques in convex optimization, geometry, spectral graph theory and randomization. The matroid intersection problem has a specific model bipartite matching. He is particularly interested in combining convex optimization and combinations techniques to design fast algorithms for fundamental optimization problems, such as linear programs, maxflow, submodular minimization, etc. For example, they are used in approximation algorithms 2, 3. An intersection of matroids is an independent system with ground set the union of the ground sets of the matroids and independence family the family of all maximally independent sets which are independent in all matroids. This problem is the special case of convex combinatorial optimization where f is either the collection b of bases considered in 39 or the collection i.
The most convenient way to formulate it is to describe it as a linear program. The algorithm for weighted matroid intersection proposed by lawler law75 is an intricate primaldual algorithmbasedonanexponentialsizelp. Improved bounds for matroid partition and intersection. However, several natural matroid problems, such as 3 matroid intersection, are nphard. An important problem of combinatorial optimization is that of finding an optimal intersection ofm 1,m 2. Lecture notes on matroid optimization march 20th, 2009 3 a very important class of matroids in combinatorial optimization is the class of graphic matroids also called cycle matroids.
For matroid intersection nothing more is known, that is, it is an open problem to find a. This webpage is an archive of my academic work until august 2018. Using techniques in convex optimization, geometry, spectral graph theory and randomization, researchers have developed provably faster algorithms for many classical problems such as linear programming and maximum flow problems. A faster cutting plane method and its implications for. Colorful spanning trees are bases of the graphic matroid m 1 mg which are also independent in the partition matroid m 2 e. For example, they are used in approximation algorithms 2, 3 and network coding 9. Mathematics stack exchange is a question and answer site for people studying math at any level and professionals in related fields. One algorithm computes an intersection containing a maximum number of elements. Keywordsnonlinear combinatorial optimizationmatroid optimizationhighperformance computinghighprecision linear algebra mathematics subject classification 2000900890c2790c26 view show. In combinatorial optimization, the matroid intersection problem is to find a largest common independent set in two matroids over the same ground set. My research area was combinatorial optimization, which lies at the intersection of operations research, computer science and mathematics. Matroid intersection and matroid parity have many applications.
1287 328 1146 1490 1091 1429 749 690 650 8 280 1201 470 1011 439 210 1273 1428 687 845 987 838 812 801 1550 1429 993 699 876 815 896 1054 1125 1350 1028 683 952 160 991 593 1388 695 16 1164 307 955 1400