Approximation Algorithms for Stochastic k-TSP.
FSTTCS(2017)
摘要
We consider the stochastic $k$-TSP problem where rewards at vertices are random and the objective is to minimize the expected length of a tour that collects reward $k$. We present an adaptive $O(log k)$-approximation algorithm, and a non-adaptive $O(log^2k)$-approximation algorithm. We also show that the adaptivity gap of this problem is between $e$ and $O(log^2k)$.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络