is creating efficient algorithms for computationally hard problems.
Many computational tasks such as clustering, identifying communities in social networks, and optimizing efficient routing data structures are NP-hard. This means that there is no known way to solve them optimally in their full generality. I am researching ways to cope with this problem, developing algorithms that find optimal solutions in the most practically relevant cases, or revealing the obstacles that prevent us from finding such algorithms.
See my website on https://manyu.pro/.