Recent advances in quantum computers are demonstrating the ability to solve problems at a
scale beyond brute force classical simulation. As such, a widespread interest in quantum …

The traveling salesman (or salesperson) problem, short TSP, is a problem of strong interest
to many researchers from mathematics, economics, and computer science. Manifold TSP …

In the last few years, Algorithms for Convex Optimization have revolutionized algorithm
design, both for discrete and continuous optimization problems. For problems like maximum …

We present a black-box reduction from the path version of the Traveling Salesman Problem
(Path TSP) to the classical tour version (TSP). More precisely, we show that given an α …

We show that the max entropy algorithm can be derandomized (with respect to a particular
objective function) to give a deterministic 3/2-ϵ approximation algorithm for metric TSP for …

Prize-Collecting TSP is a variant of the traveling salesperson problem where one may drop
vertices from the tour at the cost of vertex-dependent penalties. The quality of a solution is …

We present a new approximation algorithm for the (metric) prize-collecting traveling
salesperson problem (PCTSP). In PCTSP, opposed to the classical traveling salesperson …

We revisit the constant-factor approximation algorithm for the asymmetric traveling salesman
problem by Svensson, Tarnawski, and Végh [STOC 2018]. We improve on each part of this …

A fundamental variant of the classical traveling salesman problem (TSP) is the so-called
multiple TSP (mTSP), where a set of m salesmen jointly visit all cities from a set of n cities …

We devise a new approximation algorithm for capacitated vehicle routing. Our algorithm
yields a better approximation ratio for general capacitated vehicle routing as well as for the …