Improved approximation of the minimum cover time


Feige and Rabinovich, in [FR], gave a deterministic O(log n) approximation for the time it takes a random walk to cover a given graph starting at a given vertex. This approximation algorithm was shown to work for arbitrary reversible Markov Chains. We build on the results of [FR], and show that the original algorithm gives a O(log n) approximation as it is… (More)
DOI: 10.1016/j.tcs.2005.03.042