Algorithms and Adaptivity Gaps for Stochastic $k$-TSP

Haotian Jiang, Jian Li, Daogao Liu +1

Given a metric $(V,d)$ and a $\text{root}\in V$, the classic $\textsf{$k$-TSP}$ problem is to find a tour originating at the $\text{root}$ of minimum length that visits at lea…