Random pseudo-polynomial algorithms for exact matroid problems

PM Camerini, G Galbiati, F Maffioli - Journal of Algorithms, 1992 - Elsevier
In this work we present a random pseudo-polynomial algorithm for the problem of finding a
base of specified value in a weighted represented matroid, subject to parity conditions. We
also describe a specialized version of the algorithm suitable for finding a base of specified
value in the intersection of two matroids. This result generalizes an existing pseudo-
polynomial algorithm for computing exact arborescences in weighted graphs. Another
(simpler) specialized version of our algorithms is also presented for computing perfect …
顯示最佳搜尋結果。 查看所有結果