3 citations · 3 across the 6 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.CG2021
Fast Algorithms for Minimum Homology Basis
Amritendu Dhar, Vijay Natarajan, Abhishek Rathod
We study the problem of finding a minimum homology basis, that is, a lightest set of cycles that generates the -dimensional homology classes with coefficients in…
cs.CG2021
Parameterized inapproximability of Morse matching
Ulrich Bauer, Abhishek Rathod
We study the problem of minimizing the number of critical simplices from the point of view of inapproximability and parameterized complexity. We first show inapproximability of Min…
cs.DS2021
The complexity of high-dimensional cuts
Ulrich Bauer, Abhishek Rathod, Meirav Zehavi
Cut problems form one of the most fundamental classes of problems in algorithmic graph theory. For instance, the minimum cut, the minimum - cut, the minimum multiway cut, and…