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 ...

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 ...

Rate-splitting multiple access (RSMA) has been recognized as a promising physical layer strategy for 6G. Motivated by the ever-increasing popularity of cache-enabled content delivery in wireless ...

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 ...

There are currently more than 100,000 patients on the waiting list in the United States for a kidney transplant from a deceased donor. To address this shortage, kidney exchange programs allow patients ...