QP-2006-03

Matroid intersection for the min-rank oracle

Mihály Bárász

We present a modification of the matroid intersection algorithm for the case when the two matroids are not given explicitly, but only a minimum rank oracle is available. That is for any set we can determine only the minimum of the two ranks.

Bibtex entry:

@techreport{egresqp-06-03,

AUTHOR	=	{B{\'a}r{\'a}sz, Mih{\'a}ly},
TITLE	=	{Matroid intersection for the min-rank oracle},
NOTE	=	{{\tt egres.elte.hu}},
INSTITUTION	=	{Egerv{\'a}ry Research Group, Budapest},
YEAR	=	{2006},
NUMBER	=	{QP-2006-03}

}