The construction of t-spanners of a given point set has received a lot of attention, especially
from a theoretical perspective. In this article, we experimentally study the performance and …

Given a graph embedded in a metric space, its dilation is the maximum over all distinct pairs
of vertices of the ratio between their distance in the graph and the metric distance between …

The construction of t-spanners of a given point set has received a lot of attention, especially
from a theoretical perspective. In this paper we perform the first extensive experimental study …

Given a set P of points in the plane, an Euclidean t-spanner for P is a geometric graph that
preserves the Euclidean distances between every pair of points in P up to a constant factor t …

We introduce a new geometric spanner, δ-Greedy, whose construction is based on a
generalization of the known Path-Greedy and Gap-Greedy spanners. The δ-Greedy spanner …

The input for the Geometric Coverage problem consists of a pair\varSigma=(P, R) Σ=(P, R),
where P is a set of points in R^ d R d and RR is a set of subsets of P defined by the …

The availability of large graphs that represent huge road networks has led to a vast amount
of experimental research that has been custom-tailored for road networks. There are two …

The shortest path (SP) and shortest paths tree (SPT) problems arise both as direct
applications and as subroutines of overlay algorithms solving more complex problems such …

In this paper we devise a new geometric spanner based on a generalization of the known
Stable Roommates algorithm. This spanner is on the “path” between the Yao graph and Yao …

We introduce a new geometric spanner, δ-Greedy, whose construction is based on a
generalization of the known Path-Greedy and Gap-Greedy spanners. The δ-Greedy spanner …