Approximating geometric bottleneck shortest paths
Consider a set \(S\) of \(n\) points in the plane. Given two points \(p\) and \(q\) in \(S\), and a real number \(L\), compute a shortest path between \(p\) and \(q\) in the graph with vertex set \(S\) and all edges of length at most \(L\). Some efficient algorithms are presented for this problem.
scientific article; zbMATH DE number 2116166