A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Matroid Intersections, Polymatroid Inequalities, and Related Problems
[chapter]

2002
*
Lecture Notes in Computer Science
*

Given m matroids M1, . . . , Mm on the common ground set V , it is shown that all maximal subsets of V , independent in the m matroids, can be generated in quasi-polynomial time. More generally, given a system of polymatroid inequalities f1(X) ≥ t1, . . . , fm(X) ≥ tm with quasi-polynomially bounded right hand sides t1, . . . , tm, all minimal feasible solutions X ⊆ V to the system can be generated in incremental quasi-polynomial time. Our proof of these results is based on a combinatorial

doi:10.1007/3-540-45687-2_11
fatcat:ggtafactyngwvo5dusjol5ih34