An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces (Q5054837): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/BFb0054351 / rank | |||
| Property / cites work | |||
| Property / cites work: An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4348479 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: How to take short cuts / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The weighted region problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algorithm for shortest-path motion in three dimensions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Shortest Paths in Polyhedral Spaces / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/BFB0054351 / rank | |||
Normal rank | |||
Latest revision as of 15:45, 30 December 2024
scientific article; zbMATH DE number 7631781
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces |
scientific article; zbMATH DE number 7631781 |
Statements
An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces (English)
0 references
9 December 2022
0 references
