no code implementations • 21 Dec 2016 • Zijun Wu, Rolf Moehring, Jianhui Lai
For simple instances that have a $\{1, n\}$-valued distance function and a unique optimal solution, we prove a stochastic runtime of $O(n^{6+\epsilon})$ with the vertex-based random solution generation, and a stochastic runtime of $O(n^{3+\epsilon}\ln n)$ with the edge-based random solution generation for an arbitrary $\epsilon\in (0, 1)$.
