Name: The Shortest-Path Problem: Analysis and Comparison of Methods (en Inglés)
Price: 272116.00 COP
Availability: InStock
Author: Gonzalez-Escribano, Arturo ; Llanos, Diego R. ; Ortega-Arranz, Hector
ISBN: 9783031014468

portada The Shortest-Path Problem: Analysis and Comparison of Methods (en Inglés)

Formato

Libro Físico

Autor

Arturo Gonzalez-Escribano

Diego R. Llanos

Hector Ortega-Arranz

Editorial

Springer

Idioma

Inglés

N° páginas

Encuadernación

Tapa Blanda

Dimensiones

23.5 x 19.1 x 0.5 cm

Peso

0.17 kg.

ISBN13

9783031014468

N° edición

Categorías

Combinatoria y teoría de grafos
Inteligencia artificial

The Shortest-Path Problem: Analysis and Comparison of Methods (en Inglés)

Arturo Gonzalez-Escribano (Autor) · Diego R. Llanos (Autor) · Hector Ortega-Arranz (Autor) · Springer · Tapa Blanda

Libro Físico

$ 272.116

$ 418.640

Ahorras: $ 146.524

35% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Viernes 21 de Junio y el Martes 02 de Julio.

Lo recibirás en cualquier lugar de Colombia entre 1 y 5 días hábiles luego del envío.

Reseña del libro "The Shortest-Path Problem: Analysis and Comparison of Methods (en Inglés)"

Many applications in different domains need to calculate the shortest-path between two points in a graph. In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques. Since several of these improvements involve subtle changes to the search space, it may be difficult to appreciate their benefits in terms of time or space requirements. To make methods more comprehensive and to facilitate their comparison, this book presents a single case study that serves as a common benchmark. The paper also compares the search spaces explored by the methods described, both from a quantitative and qualitative point of view, and including an analysis of the number of reached and settled nodes by different methods for a particular topology. Table of Contents: List of Figures / List of Tables / Acknowledgments / Introduction / Graph Theory Basics / Classical Algorithms / Hierarchical Preprocessing-Dependent Approaches / Non-Hierarchical Preprocessing-Dependent Approaches / Analysis and Comparison of Approaches / Conclusions / Bibliography / Authors' Biographies