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 …

Wie bestimmt man in einer Menge von Punkten am schnellsten zu jedem Punkt seinen
nächsten Nachbarn? Wie läßt sich der Durchschnitt von zwei Polygonen effizient …

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

In the current chapter, we consider geometric networks and two important quality measures
of such networks; namely, dilation and detour. A geometric network is an undirected graph …

We show that, for any fixed constant k⩾ 3, the sum of the distances between all pairs of
vertices of an abstract graph with n vertices and treewidth at most k can be computed in O …

(I) We exhibit a set of 23 points in the plane that has dilation at least 1. 4 3 0 8, improving the
previous best lower bound of 1. 4 1 6 1 for the worst-case dilation of plane spanners.(II) For …

The classical theory of individual classes of planar curves is a well-known field between
Elementary, Differential, and Algebraic Geometry. With the present expository paper we …

Given two points on a closed planar curve, C, we can divide the length of a shortest
connecting path in C by their Euclidean distance. The supremum of these ratios, taken over …

Algorithms for network problems play an increasingly important role in modern society. The
graph structure of a network is an abstract and very useful representation that allows …