Filters








46,281 Hits in 6.8 sec

Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison [chapter]

Víctor M. Jiménez, Andrés Marzal
1999 Lecture Notes in Computer Science  
A new algorithm to compute the K shortest paths (in order of increasing length) between a given pair of nodes in a digraph with n nodes and m arcs is presented.  ...  After the shortest path from the initial node to every other node has been computed, the algorithm finds the K shortest paths in O(m + Kn log(m/n)) time.  ...  In this paper, a new algorithm that finds the K shortest s-t paths is proposed.  ... 
doi:10.1007/3-540-48318-7_4 fatcat:7fvljglx6rfbtjhzuq3s7zv6yu

Relative Entropy-Regularized Optimal Transport on a Graph: a new algorithm and an experimental comparison [article]

Sylvain Courtain, Guillaume Guex, Ilkka Kivimaki, Marco Saerens
2021 arXiv   pre-print
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism.  ...  The resulting optimal routing policy, i.e., the probability distribution of following an edge in each node, is Markovian and is computed by constraining the input and output flows to the prescribed marginal  ...  It simply computes the new probability distribution P * (·).  ... 
arXiv:2108.10004v2 fatcat:aan3ffcbonhuxg67v3xrtjhgl4

Using software complexity measures to analyze algorithms—an experiment with the shortest-paths algorithms

Jukka K. Nurminen
2003 Computers & Operations Research  
In this paper, we apply di erent software complexity measures to a set of shortest-path algorithms.  ...  The experiment indicates that the software complexity measures give a new dimension to empirical algorithm comparison.  ...  Thanks are also due to the anonymous referees for their comments and suggestions.  ... 
doi:10.1016/s0305-0548(02)00060-6 fatcat:2mw73zvvbbd4bocmwe7w57zqjm

Two-level heaps: a new priority queue structure with applications to the single source shortest path problem

K. Subramani, Kamesh Madduri
2010 Computing  
The Single Source Shortest Paths problem with positive edge weights (SSSPP) is one of the more widely studied problems in Operations Research and Theoretical Computer Science [1,2] on account of its wide  ...  In this paper, we introduce a new data structure to implement priority queues called Two-Level Heap (TLH) and a new variant of Dijkstra's algorithm called Phased Dijkstra.  ...  Acknowledgments The research of the first author was conducted in part at the Discrete Algorithms and Mathematics Department, Sandia National Laboratories, Albuquerque, New  ... 
doi:10.1007/s00607-010-0112-1 fatcat:dtyxzofivzfmxlmx3io77qi4zu

Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem [chapter]

K. Subramani, Kamesh Madduri
2009 Lecture Notes in Computer Science  
The Single Source Shortest Paths problem with positive edge weights (SSSPP) is one of the more widely studied problems in Operations Research and Theoretical Computer Science [1,2] on account of its wide  ...  In this paper, we introduce a new data structure to implement priority queues called Two-Level Heap (TLH) and a new variant of Dijkstra's algorithm called Phased Dijkstra.  ...  Acknowledgments The research of the first author was conducted in part at the Discrete Algorithms and Mathematics Department, Sandia National Laboratories, Albuquerque, New  ... 
doi:10.1007/978-3-642-02026-1_17 fatcat:5zpmtpflkvg2vi6rnv3cigzwdi

A single source k-shortest paths algorithm to infer regulatory pathways in a gene network

Yu-Keng Shih, Srinivasan Parthasarathy
2012 Computer applications in the biosciences : CABIOS  
Results: In a departure from previous approaches that largely rely on the random walk model, we propose a novel singlesource k-shortest paths based algorithm to address this inference problem.  ...  An important element of our approach is to explicitly account for and enhance the diversity of paths discovered by our algorithm.  ...  Kai Tan (Iowa) and Nusrat S. Islam (Ohio St.) for initial discussions related to this work.  ... 
doi:10.1093/bioinformatics/bts212 pmid:22689778 pmcid:PMC3371844 fatcat:xkldcncqwrftndje356bt6gk2i

A Constrained K-shortest Path Algorithm to Rank the Topologies of the Protein Secondary Structure Elements Detected in CryoEM Volume Maps

Kamal Al Nasr, Lin Chen, Desh Ranjan, M. Zubair, Dong Si, Jing He
2007 Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics - BCB'13  
We illustrate an approach to obtain the top-K topologies by combining a dynamic programming algorithm with the K-shortest path algorithm.  ...  The effectiveness of the algorithms is demonstrated from the test using three datasets of different nature. The algorithm improves the accuracy, space and time of an existing method.  ...  We illustrate an approach to find the top-K topologies using a combination of a dynamic programming and the K-shortest paths algorithms.  ... 
doi:10.1145/2506583.2506705 dblp:conf/bcb/Al-NasrCRZSH13 fatcat:k5vesaegcva37gjzuqfsq6oy2a

Shorter Path Constraints for the Resource Constrained Shortest Path Problem [chapter]

Thorsten Gellermann, Meinolf Sellmann, Robert Wright
2005 Lecture Notes in Computer Science  
We provide the first extensive experimental evaluation of the new algorithms in the context of the resource constrained shortest path problem.  ...  . , X m , and an objective bound B ∈ Z.  ...  v 1 , v n ∈ V , the resource constrained shortest path problem (RCSPP) consists in the computation of a path P ⊆ E such that e∈P l k e ≤ L k for all 1 ≤ k ≤ R and e∈P l 0 e is minimal.  ... 
doi:10.1007/11493853_16 fatcat:vtaj7vccdbfmlm7bdfomhsltme

Path enumeration by finding the constrained K-shortest paths

N.J. van der Zijpp, S. Fiorenzo Catalano
2005 Transportation Research Part B: Methodological  
This paper deals with algorithms for finding the constrained K-shortest paths (CKSP) and their application to the path enumeration problem.  ...  A new method is proposed that finds the feasible shortest paths directly and can be applied in combination with a wide class of constraints.  ...  These overall shortest paths have been computed with a K-shortest path algorithm.  ... 
doi:10.1016/j.trb.2004.07.004 fatcat:267qqzc7rfbxjm2nuvgepbwsba

Resource Constrained Shortest Paths [chapter]

Kurt Mehlhorn, Mark Ziegelmann
2000 Lecture Notes in Computer Science  
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete.  ...  In the experimental part we compare the hull approach to previous methods for solving the LP relaxation and give an exact algorithm based on the hull approach.  ...  Conclusion We presented an algorithm that computes upper and lower bounds for CSP by exactly solving an LP relaxation.  ... 
doi:10.1007/3-540-45253-2_30 fatcat:ojtlssuojfa4bl3vulsavs7bti

Dynamic Shortest Paths Containers

Dorothea Wagner, Thomas Willhalm, Christos Zaroliagis
2004 Electronical Notes in Theoretical Computer Science  
In this paper, we present new algorithms as well as an empirical study for the dynamic case of this problem, where edge weights are subject to change and the bounding boxes have to be updated.  ...  We evaluate the quality and the time for different update strategies that guarantee correct shortest paths in an interesting application to railway information systems, using real-world data from six European  ...  More precisely, for every new shortest path u 0 , u 1 , . . . , u k−1 , u k in the graph, T (u 0 , u 1 ) and S(u k−1 , u k ) have to be updated to include u k and u 0 , respectively.  ... 
doi:10.1016/j.entcs.2003.12.023 fatcat:ncuoz5bbdnhwfhtrbaaubnhy5y

A fast path planning by path graph optimization

Joo Young Hwang, Jun Song Kim, Sang Seok Lim, Kyu Ho Park
2003 IEEE transactions on systems, man and cybernetics. Part A. Systems and humans  
Dijkstra's shortest path searching algorithm is used to search the shortest path in the path graph.  ...  Experimental results show that the path planning using the optimized path graph is an order of magnitude faster than the quadtree approach while the length of the path generated by the proposed method  ...  Dijkstra's shortest path searching algorithm is used for searching the shortest path in a path graph, and a simple path relaxation algorithm is used to optimize the path.  ... 
doi:10.1109/tsmca.2003.812599 fatcat:dfhhdsvlffctdmpglxqhcsimmy

Enhancing Path Quality of Real-Time Path Planning Algorithms for Mobile Robots: A Sequential Linear Paths Approach

Raouf Fareh, Mohammed Baziyad, Tamer Rabie, Maamar Bettayeb
2020 IEEE Access  
Table 3 shows a detailed comparison between the proposed SLP strategy and the corresponding basis algorithm in terms of path length. Table 3 shows an outstanding performance.  ...  However, a very high value of N will increase the complexity and thus, will increase the computational time required to find the shortest path.  ... 
doi:10.1109/access.2020.3016525 fatcat:263ppvvx6bg5xkppyvekruwzne

Shortest-path feasibility algorithms

Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert E. Tarjan, Renato F. Werneck
2009 ACM Journal of Experimental Algorithmics  
This is an experimental study of algorithms for the shortest path feasibility problem: Given a directed weighted graph, find a negative cycle or present a short proof that none exists.  ...  We show that, while no single algorithm dominates, a small subset (including a new algorithm) has very robust performance in practice. Our work advances state of the art in the area.  ...  Section 7 describes our experimental setup and presents an empirical comparison of the various algorithms studied. Finally, Section 8 presents concluding remarks.  ... 
doi:10.1145/1498698.1537602 fatcat:tgfc6mha6veztcrmql4sy5u26q

Path queries for transportation networks

Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner
1996 Proceedings of the fourth ACM workshop on Advances in geographic information systems - GIS '96  
Our results show that our new approach outperforms the alternative approaches significantly for highly cyclic graphs such as GIS maps.  ...  In this paper, we explore the development of special-purpose disk-based techniques for supporting the processing of path queries on transportation networks.  ...  The BSR -An Integrated Solution The BSR matcrializcs the parh vieivs for a given graph by computing a single-source puth view for every node in the graph using a single-source BI;S shortest path algorithm  ... 
doi:10.1145/258319.258325 dblp:conf/gis/HuangJR96 fatcat:rvathvojd5d4ppiqt6idyvk454
« Previous Showing results 1 — 15 out of 46,281 results