The Shortest-Path Problem

Name: The Shortest-Path Problem
Brand: Springer Nature
SKU: 9783031014468
Availability: InStock

The Shortest-Path Problem

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9783031014468

Condition

New

0 Reviews

0 Questions | 0 Answers

Product Description

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.

Available Colors

N/A

Available Sizes

N/A

1 Offer Price Range: $39.99 - $39.99

BEST PRICE

Single Product Purchase

$39.99

@ Link.springer.com BUY Now

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com Rate Seller This functionality is for registered users only. Go to Login/Register		$39.99	$39.99			$39.99		See Site	In stock	Visit Store