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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Given two matroids on the same ground set, the matroid intersection problem asks to find a common independent set of maximum size… (More)
Is this relevant?
2015
2015
As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
In this work we propose new randomized rounding algorithms for matroid intersection and matroid base polytopes. We prove… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Let f : 2 → R+ be a monotone submodular set function, and let (X, I) be a matroid. We consider the problem maxS∈I f(S). It is… (More)
Is this relevant?
2011
2011
In the buyback problem, an algorithm observes a sequence of bids and must decide whether to accept each bid at the moment it… (More)
  • figure 1
  • figure 2
Is this relevant?
1997
1997
Let M 1 and M 2 be matroids on S, B be their k-element common independent set, and w a weight function on S. Given two functions… (More)
Is this relevant?
1996
1996
The independent assignment problem (or the weighted matroid intersection problem) is extended using Dress-Wenzel’s matroid… (More)
Is this relevant?
1996
1996
Based on the optimality criteria established in Part I, we show a primal-type cyclecanceling algorithm and a primal-dual-type… (More)
Is this relevant?
1979
1979
Given a matroid, where each element has a realvalued cost and is colored red or green; we seek a minimum cost base with exactly q… (More)
  • figure 1
Is this relevant?
Highly Cited
1975
Highly Cited
1975
Let M 1 = (E, ~1 ), g 2 = (E, 92) be two matroids over the same set of e lements E, and with families of independent sets 91, 92… (More)
Is this relevant?