The Shortest-Path Problem (Record no. 85192)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 03825nam a22005775i 4500 |
001 - CONTROL NUMBER | |
control field | 978-3-031-02574-7 |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20240730164005.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 220601s2015 sz | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 9783031025747 |
-- | 978-3-031-02574-7 |
082 04 - CLASSIFICATION NUMBER | |
Call Number | 510 |
100 1# - AUTHOR NAME | |
Author | Gonzalez-Escribano, Arturo. |
245 14 - TITLE STATEMENT | |
Title | The Shortest-Path Problem |
Sub Title | Analysis and Comparison of Methods / |
250 ## - EDITION STATEMENT | |
Edition statement | 1st ed. 2015. |
300 ## - PHYSICAL DESCRIPTION | |
Number of Pages | XV, 71 p. |
490 1# - SERIES STATEMENT | |
Series statement | Synthesis Lectures on Theoretical Computer Science, |
505 0# - FORMATTED CONTENTS NOTE | |
Remark 2 | 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 . |
520 ## - SUMMARY, ETC. | |
Summary, etc | 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. |
700 1# - AUTHOR 2 | |
Author 2 | Llanos, Diego R. |
700 1# - AUTHOR 2 | |
Author 2 | Ortega-Arranz, Hector. |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | https://doi.org/10.1007/978-3-031-02574-7 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | eBooks |
264 #1 - | |
-- | Cham : |
-- | Springer International Publishing : |
-- | Imprint: Springer, |
-- | 2015. |
336 ## - | |
-- | text |
-- | txt |
-- | rdacontent |
337 ## - | |
-- | computer |
-- | c |
-- | rdamedia |
338 ## - | |
-- | online resource |
-- | cr |
-- | rdacarrier |
347 ## - | |
-- | text file |
-- | |
-- | rda |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Mathematics. |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computer science. |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Graph theory. |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Artificial intelligence. |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Biomathematics. |
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Mathematics. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Theory of Computation. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Graph Theory. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Artificial Intelligence. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Mathematical and Computational Biology. |
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
-- | 2376-9726 |
912 ## - | |
-- | ZDB-2-SXSC |
No items available.