www.cs.cmu.edu

15-854: Approximation Algorithms

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

Approximation algorithms for orienteering and discounted-reward TSP

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

A 1.5-Approximation for Symmetric Euclidean Open Loop TSP

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

Neural Decoders Using Reinforcement Learning in Brain Machine Interfaces: A Technical Review

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

Distributed algorithms from arboreal ants for the shortest path problem

Evolution has led to natural algorithms that regulate collective behavior in many biological systems. Here, we investigate natural algorithms that solve the shortest path problem, a basic optimization ...
Frontiers

Rate-Splitting Multiple Access in Cache-Aided Cloud-Radio Access Networks

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