Items related to The Shortest-Path Problem: Analysis and Comparison...

The Shortest-Path Problem: Analysis and Comparison of Methods (Synthesis Lectures on Theoretical Computer Science) - Softcover

 
9783031014468: The Shortest-Path Problem: Analysis and Comparison of Methods (Synthesis Lectures on Theoretical Computer Science)

Synopsis

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

"synopsis" may belong to another edition of this title.

About the Author

Hector Ortega-Arranz received his M.S. in Computer Science Engineering, and his M.S. in Research in Information and Communication Technologies, from the Universidad de Valladolid, Spain, in 2010 and 2011, respectively. He is currently a researcher and a Ph.D. candidate in the Department of Computer Science of this university. His research interests include shortest-path algorithms, parallel and distributed computing, and GPU computing. Diego R. Llanos received his M.S. and Ph.D. degrees in Computer Science from the Universidad de Valladolid, Spain, in 1996 and 2000, respectively. He is a recipient of the Spanish government's national award for academic excellence. Dr. Llanos is Associate Professor of Computer Architecture at the Universidad de Valladolid, and his research interests include parallel and distributed computing, automatic parallelization of sequential code, and embedded computing. He is a Senior Member of the IEEE and Senior Member of the ACM. Arturo Gonzalez-Escribano received his M.S. and Ph.D. degrees in Computer Science from the Universidad de Valladolid, Spain, in 1996 and 2003, respectively. Dr. Gonzalez-Escribano is Associate Professor of Computer Science at the Universidad de Valladolid, and his research interests include parallel and distributed computing, parallel programming models, and embedded computing. He is a Member of the IEEE Computer Society and Member of the ACM.

"About this title" may belong to another edition of this title.

Other Popular Editions of the Same Title

9781627055390: The Shortest-Path Problem: Analysis and Comparison of Methods (Synthesis Lectures on Computer Science)

Featured Edition

ISBN 10:  1627055398 ISBN 13:  9781627055390
Publisher: Morgan & Claypool Publishers, 2014
Softcover

Search results for The Shortest-Path Problem: Analysis and Comparison...

Stock Image

Gonzalez-Escribano, Arturo; Llanos, Diego R.; Ortega-Arranz, Hector
Published by Springer, 2014
ISBN 10: 3031014464 ISBN 13: 9783031014468
New Softcover

Seller: Ria Christie Collections, Uxbridge, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. In English. Seller Inventory # ria9783031014468_new

Contact seller

Buy New

£ 44.32
Convert currency
Shipping: FREE
Within United Kingdom
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Ortega-Arranz, Hector
Published by Springer 2014-12, 2014
ISBN 10: 3031014464 ISBN 13: 9783031014468
New PF

Seller: Chiron Media, Wallingford, United Kingdom

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

PF. Condition: New. Seller Inventory # 6666-IUK-9783031014468

Contact seller

Buy New

£ 42.05
Convert currency
Shipping: £ 2.49
Within United Kingdom
Destination, rates & speeds

Quantity: 10 available

Add to basket

Seller Image

Hector Ortega-Arranz
ISBN 10: 3031014464 ISBN 13: 9783031014468
New Taschenbuch
Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 88 pp. Englisch. Seller Inventory # 9783031014468

Contact seller

Buy New

£ 42.98
Convert currency
Shipping: £ 9.54
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 2 available

Add to basket

Stock Image

Gonzalez-Escribano, Arturo; Llanos, Diego R.; Ortega-Arranz, Hector
Published by Springer, 2014
ISBN 10: 3031014464 ISBN 13: 9783031014468
New Softcover

Seller: California Books, Miami, FL, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # I-9783031014468

Contact seller

Buy New

£ 47.22
Convert currency
Shipping: £ 7.39
From U.S.A. to United Kingdom
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

Arturo Gonzalez-Escribano
ISBN 10: 3031014464 ISBN 13: 9783031014468
New Taschenbuch

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783031014468

Contact seller

Buy New

£ 42.98
Convert currency
Shipping: £ 12.13
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

Hector Ortega-Arranz|Arturo Gonzalez-Escribano|Diego R. Llanos
ISBN 10: 3031014464 ISBN 13: 9783031014468
New Kartoniert / Broschiert
Print on Demand

Seller: moluna, Greven, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Hector Ortega-Arranz received his M.S. in Computer Science Engineering, and his M.S. in Research in Information and Communication Technologies, from the Universidad de Valladolid, Spain, in 2010 and 2011, respectively. He is currently a researcher and a Ph. Seller Inventory # 608129614

Contact seller

Buy New

£ 38.36
Convert currency
Shipping: £ 21.66
From Germany to United Kingdom
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Gonzalez-Escribano, Arturo; Llanos, Diego R.; Ortega-Arranz, Hector
Published by Springer, 2014
ISBN 10: 3031014464 ISBN 13: 9783031014468
New Softcover
Print on Demand

Seller: Majestic Books, Hounslow, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Print on Demand. Seller Inventory # 402360444

Contact seller

Buy New

£ 56.83
Convert currency
Shipping: £ 3.35
Within United Kingdom
Destination, rates & speeds

Quantity: 4 available

Add to basket

Stock Image

Gonzalez-Escribano, Arturo; Llanos, Diego R.; Ortega-Arranz, Hector
Published by Springer, 2014
ISBN 10: 3031014464 ISBN 13: 9783031014468
New Softcover

Seller: Books Puddle, New York, NY, U.S.A.

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Condition: New. 1st edition NO-PA16APR2015-KAP. Seller Inventory # 26395065251

Contact seller

Buy New

£ 55.06
Convert currency
Shipping: £ 6.65
From U.S.A. to United Kingdom
Destination, rates & speeds

Quantity: 4 available

Add to basket

Stock Image

Gonzalez-Escribano, Arturo; Llanos, Diego R.; Ortega-Arranz, Hector
Published by Springer, 2014
ISBN 10: 3031014464 ISBN 13: 9783031014468
New Softcover
Print on Demand

Seller: Biblios, Frankfurt am main, HESSE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. PRINT ON DEMAND. Seller Inventory # 18395065257

Contact seller

Buy New

£ 61.02
Convert currency
Shipping: £ 6.89
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 4 available

Add to basket

Seller Image

Arturo Gonzalez-Escribano
ISBN 10: 3031014464 ISBN 13: 9783031014468
New Taschenbuch

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. Neuware -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' BiographiesSpringer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 88 pp. Englisch. Seller Inventory # 9783031014468

Contact seller

Buy New

£ 42.98
Convert currency
Shipping: £ 30.34
From Germany to United Kingdom
Destination, rates & speeds

Quantity: 2 available

Add to basket