Finding real-valued single-source shortest paths in o(n 3) expected time-Reference-Cited by-同舟云学术

Finding real-valued single-source shortest paths in o(n 3) expected time

Published:1996 Issue: Volume: Page:94-104
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Kolliopoulos Stavros G.,Stein Clifford

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61310-2_8.pdf

Reference23 articles.

1. R. K. Ahuja, T. L. Magnanti and J. B. Orlin. Network Flows, Prentice Hall, Englewood Cliffs, NJ, 1993.

2. N. Alon, Z. Galil and O. Margalit. On the exponent of the all pairs shortest path problem, Proc. 32nd IEEE Symp. Found. Comp. Sci., 1991, 569–575.

3. R. Bellman. On a routing problem, Quarterly of Appl. Math., 16 (1958), 87–90.

4. P. A. Bloniarz, A. Meyer and M. Fischer. Some observations on Spira's shortest path algorithm, Tech. Rept. 79-6, Comp. Sci. Dept., State University of New York at Albany, Albany, NY, 1979.

5. P. A. Bloniarz. A shortest path algorithm with expected time O(n 2log n log* n), SIAM J. Comput., 12 (1983), 588–600.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Soft Constraints and Heuristic Constraint Correction in Entity-Relationship Modelling;Semantics in Databases;2003

2. Coping with Inconsistent Constraint Specifications;Conceptual Modeling — ER 2001;2001

3. Probabilistic Analysis of Algorithms;Algorithms and Combinatorics;1998

4. Average-case complexity of shortest-paths problems in the vertex-potential model;Randomization and Approximation Techniques in Computer Science;1997

5. Negative-cycle detection algorithms;Algorithms — ESA '96;1996