Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
As part of the recent developments in infinite matroid theory, there have been a number of conjectures about how standard… Expand
  • figure 1
  • figure 2
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… Expand
Is this relevant?
2004
2004
 
Is this relevant?
1997
1997
  • M. Cai, Y. Li
  • Math. Methods Oper. Res.
  • 1997
  • Corpus ID: 37347607
LetM1 andM2 be matroids onS,B be theirk-element common independent set, andw a weight function onS. Given two functionsb ≥ 0 andc… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
  • K. Murota
  • SIAM J. Discret. Math.
  • 1996
  • Corpus ID: 15710161
The independent assignment problem (or the weighted matroid intersection problem) is extended using Dress and Wenzel's matroid… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
  • K. Murota
  • SIAM J. Discret. Math.
  • 1996
  • Corpus ID: 15885600
Based on the optimality criteria established in part I [{\em SIAM J. Discrete Math.}, 9 (1996), pp. 545--561] we show a primal… Expand
Is this relevant?
1989
1989
Consider a matroid of rank n in which each element has a real-valued cost and one of $d > 1$ colors. A class of matroid… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1988
Highly Cited
1988
In this paper, we suggest new scaling algorithms for the assignment and minimum cycle mean problems. Our assignment algorithm is… Expand
  • figure 1
Is this relevant?
Highly Cited
1981
Highly Cited
1981
L. G. Khachiyan recently published a polynomial algorithm to check feasibility of a system of linear inequalities. The method is… Expand
Is this relevant?
Highly Cited
1975
Highly Cited
1975
  • E. Lawler
  • Math. Program.
  • 1975
  • Corpus ID: 206801650
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… Expand
Is this relevant?