Distributed computing concerns environments in which many processors, located at different
sites, must operate in a noninterfering and cooperative manner. Each of the processors …

Given a graph G, a subgraph G'is at-spanner of G if, for every u, v ɛ V, the distance from u to
v in G'is at most t times longer than the distance in G. In this paper we give a simple …

This paper provides a novel technique for the analysis of randomized algorithms for
optimization problems on metric spaces, by relating the randomized performance ratio for …

We improve the result of [BartSG] on probabilistic approximation of metric spaces by
“hierarchically wellseparated tree” metric spaces. We obtain an approximation factor of O …

Two conflicting goals play a crucial role in the design of routing schemes for communication
networks. A routing scheme should use paths that are as short as possible for routing …

How to represent a graph in memory is a fundamental data structuring question. In the usual
representations of an n-node graph, the names of the nodes (ie integers from 1 to n) betray …

A collection of clustering and decomposition techniques that make possible the construction
of sparse and locality-preserving representations for arbitrary networks is presented. The …

Delivering messages between pairs of processors is a basic and primary activity of any
distributed communication network. This task is performed using a routing scheme, which is …

We present the first universal compact routing algorithm with maximum stretch bounded by 3
that uses sublinear space at every vertex. The algorithm uses local routing tables of size O …

Peer-to-peer (P2P) networks are gaining popularity in many applications such as file
sharing, e-commerce, and social networking, many of which deal with rich, distributed data …