2 citations · 4 across the 16 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
Breaking O(nr) for Matroid Intersection
Joakim Blikstad
We present algorithms that break the -independence-query bound for the Matroid Intersection problem for the full range of ; where is the size of the ground set…
cs.DS2021
Breaking the Quadratic Barrier for Matroid Intersection
Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay +1
The matroid intersection problem is a fundamental problem that has been extensively studied for half a century. In the classic version of this problem, we are given two matroids $\…