16 citations · 40 across the 7 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Weighted Matchings via Unweighted Augmentations
Buddhima Gamlath, Sagar Kale, Slobodan Mitrović +1
We design a generic method for reducing the task of finding weighted matchings to that of finding short augmenting paths in unweighted graphs. This method enables us to provide eff…
cs.DS2018
Small Space Stream Summary for Matroid Center
Sagar Kale
In the matroid center problem, which generalizes the -center problem, we need to pick a set of centers that is an independent set of a matroid with rank . We study this probl…