29 citations · 53 across the 16 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms
Fredrik Manne, Geevarghese Philip, Saket Saurabh +1
Lokshtanov et al.~[STOC 2017] introduced \emph{lossy kernelization} as a mathematical framework for quantifying the effectiveness of preprocessing algorithms in preserving approxim…
cs.DS2021
Diverse Collections in Matroids and Graphs
Fedor V. Fomin, Petr A. Golovach, Fahad Panolan +2
We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems, two from the theory of matroids and the third from gra…