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

Department of Engineering Technology, Savannah State University, Savannah, GA, USA. Our analysis reveals that most claimed applications of Grover’s algorithm fall into one of several categories: Those ...

Department of Engineering Technology, Savannah State University, Savannah, GA, USA. Classical algorithms can use loops with arbitrary depth because classical bits persist in physical memory—the state ...

In the world of software and data, you track how an algorithm’s time and memory needs grow (time and memory) as the input size grows. In practical terms, it’s a measure of an algorithm’s efficiency – ...

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

Cholangiocarcinoma, classified as intrahepatic, perihilar, and extrahepatic, is considered a deadly malignancy of the hepatobiliary system. Most cases of cholangiocarcinoma are asymptomatic. Therefore ...

In this work, we address these open questions by introducing a symmetry-preserving ansatz for learning problems where the training data is given in form of weighted graphs, and study its performance ...

In the era of Noisy Intermediate-Scale Quantum (NISQ) computers it is crucial to design quantum algorithms which do not require many qubits or deep circuits. Unfortunately, most of the well-known ...