Picture 1 of 2
Gallery
Picture 1 of 2
Have one to sell?
Faster Algorithms for the Shortest Path Problem (Classic Reprint)
US $17.40
ApproximatelyS$ 22.33
Condition:
Brand New
A new, unread, unused book in perfect condition with no missing or damaged pages.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
Free USPS Media MailTM.
Located in: New York NY, United States
Delivery:
Estimated between Wed, 13 Aug and Wed, 20 Aug to 91768
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Shop with confidence
Seller assumes all responsibility for this listing.
eBay item number:135167089939
Item specifics
- Condition
- Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See all condition definitionsopens in a new window or tab
- Original Language
- English
- Country/Region of Manufacture
- America
- Narrative Type
- Nonfiction
- Intended Audience
- Adults
- Personalize
- No
- Inscribed
- No
- Ex Libris
- No
- Personalized
- No
- Signed
- No
- Type
- textbook
- ISBN
- 9781332260768
About this product
Product Identifiers
Publisher
Forgotten Books
ISBN-10
1332260764
ISBN-13
9781332260768
eBay Product ID (ePID)
246365452
Product Key Features
Book Title
Faster Algorithms for the Shortest Path Problem (Classic Reprint)
Number of Pages
48 Pages
Language
English
Publication Year
2015
Topic
General, Calculus
Illustrator
Yes
Genre
Mathematics, History
Format
Trade Paperback
Dimensions
Item Height
0.1 in
Item Weight
2.7 Oz
Item Length
9 in
Item Width
6 in
Additional Product Features
Intended Audience
Trade
Synopsis
Excerpt from Faster Algorithms for the Shortest Path Problem In this paper, we present the fastest known algorithms for the shortest path problem with nonnegative integer arc lengths We consider networks with n nodes and m arcs and in which C represents the largest arc length in the network. Our algorithms are obtained by implementing Dijkstra's algorithm using a new data structure which we call a redistributive heap The one-level redistributive heap consists of O(log C) buckets, each with an associated range of integer numbers Each bucket stores nodes whose temporary distance labels lie in its range Further, the ranges are dynamically changed during the execution, which leads to a redistribution of nodes to buckets. The resulting algorithm runs in O(m + n log C) time. Using a two-level redistributive heap, we improve the complexity of this algorithm to O(m + n log C/ log log nC). Finally, we use a modified version of Fibonacci heaps to reduce the complexity of our algorithm to O(m + n log C ). This algorithm, under the assumption that the largest arc length is bounded by a polynomial function of n, runs in O(m + n log n ) time, which improves over the best previous strongly polynomial bound of O(m + n log n) due to Fredman and Tarjan. We also analyse our algorithms in the semi-logarithmic model of computation. In this model, it takes [log x/log n] time to perform arithmetic on integers of value x. It is shown that in this model of computation, some of our algorithms run in linear time for sufficiently large values of C. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.", Excerpt from Faster Algorithms for the Shortest Path Problem Surprisingly, these two directions have not been very complementary. The algorithms that achieve the best worst-case complexity have generally not been attractive empirically and the algorithms that have performed well in practice have generally failed to have an attractive worst-case bound. In this paper, we present new implementations of Dijkstra's algorithm intended to bridge this gap. Under the assumption that arc lengths are bounded by a polynomial function of n these algorithms achieve the best possible worst-case complexity for all but very sparse graphs and yet are simple enough to be efficient in practice. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Item description from the seller
Seller feedback (5,399)
- n***i (49)- Feedback left by buyer.Past monthVerified purchaseExcellent super quick great find. 💜💜💜
- 6***6 (738)- Feedback left by buyer.Past monthVerified purchasePackaged well. Item just as described. Thank you!
- p***p (11012)- Feedback left by buyer.Past monthVerified purchaseFive Star Feedback for this Excellent EBay Seller.