We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …

Let G=(V, E) be an undirected weighted graph with| V|= n and| E|= m. Let k≥ 1 be an
integer. We show that G=(V, E) can be preprocessed in O (kmn 1/k) expected time …

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 …

Handbook of DISCRETE AND COMPUTATIONAL GEOMETRY Page 1 i “K25063” — 2017/9/15
— 18:58 — page 811 — i i i 31 SHORTEST PATHS AND NETWORKS Joseph SB Mitchell …

A natural and well-studied problem in algorithmic graph theory and network optimization is
that of computing a\shortest path" between two nodes, s and t, in a graph whose edges …

It is shown that a planar digraph can be preprocessed in near-linear time, producing a near-
linear space oracle that can answer reachability queries in constant time. The oracle can be …

(Titie17U.SC) Page 1 Notice: This Materiai may be protected by Copyright Law (Titie17U.SC)
Spanning Trees and Spanners David Eppstein* Dept. Information and Computer Science …

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 …

We present an O (n 1.5)-space distance oracle for directed planar graphs that answers
distance queries in O (log n) time. Our oracle both significantly simplifies and significantly …