Faster Algorithms for the Shortest Path Problem (Classic Reprint)

Ravindra K. Ahuja, Kurt Mehlhorn

ISBN 10: 1332260764 / ISBN 13: 9781332260768

Published by Forgotten Books, 2018

About this Item

Print on Demand. This book introduces new algorithms that are the fastest known for solving the shortest path problem. These algorithms implement Dijkstra's method using a new data structure called a redistributive heap. The redistributive heap divides data into ranges, and moves items between ranges as needed during the algorithm. Using this approach, the author shows that the shortest path problem can be solved in O(m n log C) time, which is asymptotically faster than previous implementations. The author goes on to introduce two more specialized variants of the algorithm: a two-level redistributive heap, which runs in O(m n log C / log log nC) time; and a modified Fibonacci heap, which runs in O(m n log C / log log nC) time. The book's analysis of these algorithms under both uniform and semi-logarithmic models of computation makes it valuable to both theorists and practitioners. Overall, this book provides a comprehensive study of the shortest path problem and its most efficient solutions to date. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book.

Seller Inventory # 9781332260768_0

Bibliographic Details

• Title: Faster Algorithms for the Shortest Path Problem (Classic Reprint)
• Publisher: Forgotten Books
• Publication Date: 2018
• Language: English
• ISBN 10: 1332260764
• ISBN 13: 9781332260768
• Binding: Paperback
• Condition: New
• Book Type: print-on-demand item
• Seller catalogs:
  • Calculus

About this title

Synopsis

This book introduces new algorithms that are the fastest known for solving the shortest path problem. These algorithms implement Dijkstra's method using a new data structure called a redistributive heap. The redistributive heap divides data into ranges, and moves items between ranges as needed during the algorithm. Using this approach, the author shows that the shortest path problem can be solved in O(m n log C) time, which is asymptotically faster than previous implementations. The author goes on to introduce two more specialized variants of the algorithm: a two-level redistributive heap, which runs in O(m n log C / log log nC) time; and a modified Fibonacci heap, which runs in O(m n log C / log log nC) time. The book's analysis of these algorithms under both uniform and semi-logarithmic models of computation makes it valuable to both theorists and practitioners. Overall, this book provides a comprehensive study of the shortest path problem and its most efficient solutions to date.