collaborators

1 paper

cs.DS2024

Sublinear Algorithms for TSP via Path Covers

Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein +1

We study sublinear time algorithms for the traveling salesman problem (TSP). First, we focus on the closely related {\em maximum path cover} problem, which asks for a collection of…