Amanote Research
Register
Sign In
An Ω(n2 Log N) Lower Bound to the Shortest Paths Problem
doi 10.1145/800105.803391
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 1977
Authors
Andrew C. Yao
David M. Avis
Ronald L. Rivest
Publisher
ACM Press
Related search
RANDOMIZATION YIELDS SIMPLE O(n Log⋆ N) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS
International Journal of Computational Geometry and Applications
Geometry
Applied Mathematics
Computational Theory
Computational Mathematics
Mathematics
Theoretical Computer Science
Topology
All Pairs Shortest Paths
An Elementary Approach to Design and Analysis of Algorithms
Shortest Gently Descending Paths
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Area-Time Optimal Division for T = Ω((log N)1 + Ε)
Information and Computation
Theoretical Computer Science
Computational Theory
Computer Science Applications
Information Systems
Mathematics
Physarum Can Compute Shortest Paths
Implementing Parallel Shortest-Paths Algorithms
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Shortest-Paths Preserving Metro Maps
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
An $O(m\log N)$-Time Algorithm for the Maximal Planar Subgraph Problem
SIAM Journal on Computing
Mathematics
Computer Science
The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest R-Constrained Ones
Journal of Artificial Intelligence Research
Artificial Intelligence
