Computing Shortest Paths in the Plane with Removable Obstacles (Q5116468)
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: Computing Shortest Paths in the Plane with Removable Obstacles |
scientific article; zbMATH DE number 7238960
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Shortest Paths in the Plane with Removable Obstacles |
scientific article; zbMATH DE number 7238960 |
Statements
25 August 2020
0 references
Euclidean shortest paths
0 references
removable polygonal obstacles
0 references
stochastic shortest paths
0 references
\(L_1\) shortest paths
0 references
0 references
Computing Shortest Paths in the Plane with Removable Obstacles (English)
0 references
