Related papers: Randomized k-server algorithms for growth-rate bou…

This paper has been withdrawn for modification.

This paper has been withdrawn by the author due to an extended and largely modified version of the paper was published in arXiv (see arXiv:0807.3694, Disjoint minimal graphs).

This paper has been withdrawn by the author.

This paper is withdrawn. The revised paper appears in chao-dyn/9904020

This paper has been withdrawn by the author.

This paper has been withdrawn by the authors due to its publication

The paper is withdrawn.

The author was informed that the result in the original version had been obtained earlier by K. Ueda (arXiv:math/0503355 [math.AG]). The paper is retracted.

This paper has been withdrawn by the authors due to an error.

This paper has been withdrawn by the author(s), due to some technical problem.

Paper has been withdrawn.

This paper has been withdrawn by the authors.

This paper has been withdrawn.

This paper has been withdrawn.

This paper has been withdrawn

This paper has been withdrawn

A modified version of this paper is under process and with a new title and abstract. Hence, this version of the article is completely withdrawn.

The paper has been withdrawn by the authors

We study the k-median and k-center problems in probabilistic graphs. We analyze the hardness of these problems, and propose several algorithms with improved approximation ratios compared with the existing proposals.

The paper has been withdrawn by the author.