Jingyang Zhao

A $(1+1/\sqrt{2})$-Approximation for the Multiple-Depot Traveling Salesman Problem

The metric traveling salesman problem (TSP) is a fundamental problem in combinatorial optimization that asks for a minimum-cost tour covering all clients in a metric graph. The metric multiple-depot TSP (MD-TSP) is a natural extension, where the graph contains depots and clients, and the objective is to compute a minim...