Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Handbook of Approximation Algorithms and Metaheuristics, Second Edition reflects the
tremendous growth in the field, over the past two decades. Through contributions from …

We obtain the following results related to dynamic versions of the shortest-paths problem:(i).
Reductions that show that the incremental and decremental single-source shortest-paths …

Euclidean spanners are important geometric structures, having found numerous
applications over the years. Cornerstone results in this area from the late 1980s and early …

The aim of this research project is to develop a smart social robot showing sufficient
intelligence to work as a tour-guide in different environments. In doing so, both a software …

An (α, β)-spanner of an unweighted graph G is a subgraph H that distorts distances in G up
to a multiplicative factor of α and an additive term β. It is well known that any graph contains …

Let S be a finite set of points in the Euclidean plane. Let D be a Delaunay triangulation of S.
The stretch factor (also known as dilation or spanning ratio) of D is the maximum ratio …

Given a weighted graph G=(V, E) and a real number t⩾ 1, a t-spanner of G is a spanning
subgraph G′ with the property that for every edge xy in G, there exists a path between x …

The greedy spanner is arguably the simplest and most well-studied spanner construction.
Experimental results demonstrate that it is at least as good as any other spanner …