Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Design issues and performance improvements in routing strategy on the internet workflow
International Journal of Network Management
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
A greedy strategy for detecting negative cost cycles in networks
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
Answering distance queries in directed graphs using fast matrix multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A Zero-Space algorithm for Negative Cost Cycle Detection in networks
Journal of Discrete Algorithms
Chain programming over difference constraints
Nordic Journal of Computing
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Discrete Event Dynamic Systems
Shortest-path feasibility algorithms: An experimental evaluation
Journal of Experimental Algorithmics (JEA)
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Maximum weight bipartite matching in matrix multiplication time
Theoretical Computer Science
A greedy strategy for detecting negative cost cycles in networks
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
ACM Transactions on Algorithms (TALG)
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
A new algorithm for linear and integer feasibility in horn constraints
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A scaling algorithm for maximum weight matching in bipartite graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Negative cycle detection problem
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Shortest paths in matrix multiplication time
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximate shortest paths in weighted graphs
Journal of Computer and System Sciences
Analyzing chain programs over difference constraints
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
An efficient label setting/correcting shortest path algorithm
Computational Optimization and Applications
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Stressing is better than relaxing for negative cost cycle detection in networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Popular matchings in the marriage and roommates problems
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
We describe a new method for designing scaling algorithms for the single-source shortest paths problem and use this method to obtain an $O(\sqrt n m \log N)$ algorithm for the problem. (Here $n$ and $m$ is the number of nodes and arcs in the input network and $N$ is essentially the absolute value of the most negative arc length, and arc lengths are assumed to be integral.) This improves previous bounds for the problem. The method extends to related problems.