The area of approximation algorithms is aimed at giving provable guarantees on the performance of heuristics for hard problems. The course will present general techniques (such as convex ...

Abstract: In this paper, we give the first constant-factor approximation algorithm for the rooted orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivated by ...

Abstract: Travelling Salesman Problem (TSP) is NP-hard and therefore lacks efficient algorithm that provides optimal solution. So far, a benchmark in this area is Christofides’ Algorithm, which ...

Creating flexible and robust brain machine interfaces (BMIs) is currently a popular topic of research that has been explored for decades in medicine, engineering, commercial, and machine-learning ...

The fault of power systems introduces a severe challenge in terms of fault recording analysis, and the traditional Prony method cannot perform satisfactorily in the process of signal recordings ...

After 44 years, there’s finally a better way to find approximate solutions to the notoriously difficult traveling salesperson problem. When Nathan Klein started graduate school two years ago, his ...