000			03454nam a22004335i 4500
999			_c387599 _d387599
001			387599
003			ES-MaUEC
005			20230327162126.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2015 sz | s |||| 0|eng d
020			_a9783031025747
024	7		_a10.1007/978-3-031-02574-7 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA166.245 _b2015 EB
100	1		_aOrtega-Arranz, Hector _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687759
245	1	4	_aThe Shortest-Path Problem : _bAnalysis and Comparison of Methods _cby Hector Ortega-Arranz, Arturo Gonzalez-Escribano, Diego R. Llanos
250			_a1st edition 2015
264		1	_aCham _bSpringer International Publishing _c2015
300			_a1 recurso en línea (XV, 71 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_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.
988			_aSynthesis Collection of Technology_2015
650		7	_2embne _9146336 _aGrafos, Teoría de
650		7	_2embne _9151819 _aAlgoritmos computacionales
700	1		_aGonzalez-Escribano, Arturo _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687760
700	1		_aLlanos, Diego R. _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9687761
776	0	8	_iPrinted edition: _z9783031014468
776	0	8	_iPrinted edition: _z9783031037023
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-02574-7 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b03/2023 _dz _esc _zSI