Több mint 4 millió cím angol és más nyelveken! Fedezd fel új történetedet még ma!

Shortest-Path Problem

Name: Shortest-Path Problem
Brand: Springer International Publishing AG
SKU: 9783031014468
Price: 17032 HUF
Availability: InStock

Analysis and Comparison of Methods

Szerző: Diego R. Llanos, Arturo Gonzalez-Escribano

Nyelv:

Kötés: Puha kötésű

Kiadó: Springer International Publishing AG

Elérhetőség: Beszállítói készleten

Küldés 5-8 napon belül

17 032 Ft

Many applications in different domains need to calculate the shortest-path between two points in a g...

Információk a könyvről

Szerző

Diego R. Llanos, Arturo Gonzalez-Escribano

Nyelv

Angol

Kötés

Könyv - Puha kötésű

Kiadva

2014

oldal

EAN

9783031014468

ISBN

3031014464

Enbook ID

39302339

Kiadó

Springer International Publishing AG

Súly

185

Méretek

191 x 235 x 6

Teljes leírá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