download process

R² - Heaps with Suspended Relaxation for Manipulating Priority Queues and a New Algorithm for Reweighting Graphs - Ruth Shrairman

Not Available

This file is no longer available on Tradebit.

Pay for R² - Heaps with Suspended Relaxation for Manipulating Priority Queues and a New Algorithm for Reweighting Graphs - Ruth Shrairman
1.894 MB File

This research is dedicated to two main problems in finding shortest paths in the graphs. The first problem is to find shortest paths from an origin to all other vertices in non-negatively weighted graph. The second problem is the same, except it is allowed that some edges are negative. This is a more difficult problem that can be solved by relatively complicated algorithms. We attack the first problem by introducing a new data structure - Relaxed Heaps that implements efficiently two main operations critical for the improvement of Dijkstra's shortest path algorithm. R²-heaps with suspended relaxation proposed in this research gives the best known worst-case time bounds of O(1) for a decrease_key operation and O(logn) for a delete_min operation. That results in the best worst-case running time for Dijkstra's algorithm O(m+nlogn), and represents an improvement over Fibonacci Heaps, which give the same , but amortized time bounds. The new data structure is simple and efficient in practical implementation. The empirical study with R²-heaps demonstrated strong advantage of its use for Dijkstra's algorithm over the "raw" Dijkstra's without heaps. This advantage is especially dramatic for sparse graphs. R²-heaps can be used in a large number of applications in which set manipulations should be implemented efficiently. For the problem of finding shortest paths in graphs with some negative edges, we present a new approach of reweighting graphs by first reducing the graph to its canonical form, which allows to apply an effective algorithm to reweight the graph to one with non-negative edges only and simultaneously to find shortest paths from an origin to all other vertices in the graph. This approach allows to give new algebraic and geometric interpretations of the problem. The experiment with the Sweeping Algorithm demonstrated O(n2 logn) expected time complexity. These results open new prospects to improve algorithms for a wide variety of problems including different network optimization problems that use Dijkstra's algorithm as a subroutine, as well as multiple Operations Research and Modeling problems that can be reduced to finding shortest paths on graphs.

Author: Shrairman, Ruth
Publisher: https://www.tradebit.com
Illustration: N
Language: ENG
Title: R - Heaps with Suspended Relaxation for Manipulating Priority Queues and a New Algorithm for Reweighting Graphs
Pages: 00143 (Encrypted PDF)
On Sale: 2005-10-31
SKU-13/ISBN: 9781581122367
Category: Computers : General


(ID 240188209)

File Data:

Contact Seller:
ebook-reader, US, Member since 09/08/2010

URL:

Embed:
Create JavaScript Mobile Tag Widgets for your homepage

More Files From This User


Tradebit Reviews

Tradebit is the worlds largest marketplace for digital files, with over 2.5 million satisfied customers and millions of digital products. Online for over 12 years, Tradebit is the best place to find files like music, video tutorials, repair manuals, and more. If you're curious about how much our users love Tradebit, read reviews from real buyers!