Cargando…
Euclidean shortest paths: exact or approximate algorithms
This book reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. The coverage includes mathematical proofs for many of the given statements.
| Autores principales: | , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Springer
2014
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/2622717 |
| Sumario: | This book reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. The coverage includes mathematical proofs for many of the given statements. |
|---|