Spatial analysis and social network analysis typically consider social processes in their own
specific contexts either geographical or network space. Both approaches demonstrate …

We seek to augment a geometric network in the Euclidean plane with shortcuts to minimize
its continuous diameter, ie, the largest network distance between any two points on the …

Graph augmentation problems are motivated by network design and have been studied
extensively in optimization. We consider augmentation problems over plane geometric …

We consider the problem of augmenting a graph with nn vertices embedded in a metric
space, by inserting one additional edge in order to minimize the diameter of the resulting …

We study the problem of finding shortest paths in the plane among h convex obstacles,
where the path is allowed to pass through (violate) up to k obstacles, for k ≤ hk≤ h …

We augment a tree T with a shortcut pq to minimize the largest distance between any two
points along the resulting augmented tree T+ pq. We study this problem in a continuous and …

We consider the problem of finding a shortcut connecting two vertices of a graph that
minimizes the diameter of the resulting graph. We present an O (n^ 2 log^ 3 n)-time …

We consider the problem of augmenting an n-vertex graph embedded in a metric space, by
inserting one additional edge in order to minimize the diameter of the resulting graph. We …

Spanner constructions focus on the initial design of the network. However, networks tend to
improve over time. In this paper, we focus on the improvement step. Given a graph and a …

Road network analysis can require distance from points that are not on the network
themselves. We study the algorithmic problem of connecting a point inside a face (region) of …