This paper considers additive and purely additive spanners. We present a new purely additive spanner of size Õ(n) with additive stretch 4. This construction fills in the gap between the two existing… (More)

The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G=(V,E) and an integer k ≥ 1, the subgraph H=(V,E'), E'⊆ E, is… (More)

In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the cost of opening the… (More)

What can a social network tell us about the underlying latent “social structure,” the way in which individuals are similar or dissimilar? Much of social network analysis is, implicitly or explicitly,… (More)

An approximate distance oracle is a succinct data structure that provides fast answers to distance queries between any two nodes of a given graph.
In this paper we consider approximate distance… (More)

The average distance from a node to all other nodes in a graph, or from a query point in a metric space to a set of points, is a fundamental quantity in data analysis. The inverse of the average… (More)

The diameter is a fundamental graph parameter and its computation is necessary in many applications. The fastest known way to compute the diameter exactly is to solve the All-Pairs Shortest Paths… (More)

We consider the problem of compact routing in weighted general undirected graphs, in which the goal is to construct local routing tables that allow information to be sent on short paths in the… (More)