Approximating geometric bottleneck shortest paths (Q1886239): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:09, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating geometric bottleneck shortest paths |
scientific article |
Statements
Approximating geometric bottleneck shortest paths (English)
0 references
18 November 2004
0 references
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.
0 references
shortest path
0 references
algorithms
0 references
