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

We introduce a random graph model based on k-trees, which can be generated by applying a probabilistic preferential attachment rule, but which also has a simple combinatorial description. We carry out a precise distributional analysis of…

This paper has been withdrawn by the author because it has been substantially modified.

The paper has been withdrawn

The paper has been withdrawn.

This paper has been withdrawn by the authors due to some fatal errors in the analysis.

This paper has been withdrawn by the author due to a crucial sign error in equation 1

The paper is withdrawn.

The article is taken out.

This paper has been withdrawn, not because of any errors (that we know of), but because rather than presenting our material as a series of 3 papers, as we originally intended, we have now combined them into one long paper, which is "A…

This paper has been withdrawn by the author.

This paper has been withdrawn by the author, due to a significant error in section 4.3.1.

This paper was withdrawn by the authors.

The paper has been withdrawn.

This paper has been withdrawn.

This document is an informal bibliography of the papers dealing with distributed approximation algorithms. A classic setting for such algorithms is bounded degree graphs, but there is a whole set of techniques that have been developed for…

This paper has been withdrawn by the author due to the need for further revision.

This paper has been withdrawn by the author due to text overlap with arXiv:1102.5004, as well as omission of proper citations to arXiv:1110.4655 and arXiv:1111.0313

This paper has been withdrawn by the author

This paper has been withdrawn by the author

The paper has been withdrawn by the author.