1 paper
Amritendu Dhar, Vijay Natarajan, Abhishek Rathod
Computing an optimal cycle in a given homology class, also referred to as the homology localization problem, is known to be an NP-hard problem in general. Furthermore, there is cur…