Approximating geometric bottleneck shortest paths (Q1886239)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximating geometric bottleneck shortest paths |
scientific article; zbMATH DE number 2116166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating geometric bottleneck shortest paths |
scientific article; zbMATH DE number 2116166 |
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
0 references
0.8098658919334412
0 references
0.8064547777175903
0 references
0.8048570156097412
0 references
0.798341691493988
0 references
