| 000 | 03825nam a22005775i 4500 | ||
|---|---|---|---|
| 001 | 978-3-031-02574-7 | ||
| 003 | DE-He213 | ||
| 005 | 20240730164005.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 220601s2015 sz | s |||| 0|eng d | ||
| 020 |
_a9783031025747 _9978-3-031-02574-7 |
||
| 024 | 7 |
_a10.1007/978-3-031-02574-7 _2doi |
|
| 050 | 4 | _aQA1-939 | |
| 072 | 7 |
_aPB _2bicssc |
|
| 072 | 7 |
_aMAT000000 _2bisacsh |
|
| 072 | 7 |
_aPB _2thema |
|
| 082 | 0 | 4 |
_a510 _223 |
| 100 | 1 |
_aGonzalez-Escribano, Arturo. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _981528 |
|
| 245 | 1 | 4 |
_aThe Shortest-Path Problem _h[electronic resource] : _bAnalysis and Comparison of Methods / _cby Arturo Gonzalez-Escribano, Diego R. Llanos, Hector Ortega-Arranz. |
| 250 | _a1st ed. 2015. | ||
| 264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2015. |
|
| 300 |
_aXV, 71 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aSynthesis Lectures on Theoretical Computer Science, _x2376-9726 |
|
| 505 | 0 | _aList 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 | _aMany 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. | ||
| 650 | 0 |
_aMathematics. _911584 |
|
| 650 | 0 |
_aComputer science. _99832 |
|
| 650 | 0 |
_aGraph theory. _93662 |
|
| 650 | 0 |
_aArtificial intelligence. _93407 |
|
| 650 | 0 |
_aBiomathematics. _95084 |
|
| 650 | 1 | 4 |
_aMathematics. _911584 |
| 650 | 2 | 4 |
_aTheory of Computation. _981529 |
| 650 | 2 | 4 |
_aGraph Theory. _93662 |
| 650 | 2 | 4 |
_aArtificial Intelligence. _93407 |
| 650 | 2 | 4 |
_aMathematical and Computational Biology. _932033 |
| 700 | 1 |
_aLlanos, Diego R. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _981530 |
|
| 700 | 1 |
_aOrtega-Arranz, Hector. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _981531 |
|
| 710 | 2 |
_aSpringerLink (Online service) _981532 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031014468 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783031037023 |
| 830 | 0 |
_aSynthesis Lectures on Theoretical Computer Science, _x2376-9726 _981533 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-02574-7 |
| 912 | _aZDB-2-SXSC | ||
| 942 | _cEBK | ||
| 999 |
_c85192 _d85192 |
||