Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Maor Akav
An Almost 2-Approximation for All-Pairs of Shortest Paths in Subquadratic Time
Related publications
All Pairs Shortest Paths
An Elementary Approach to Design and Analysis of Algorithms
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds
Finding Non-Dominated Bicriteria Shortest Pairs of Disjoint Simple Paths
Computers and Operations Research
Management Science
Simulation
Computer Science
Operations Research
Modeling
Bicriterion Shortest Paths in Stochastic Time-Dependent Networks
Lecture Notes in Economics and Mathematical Systems
Mathematics
Economics
Econometrics
Finance
Subcubic Cost Algorithms for the All Pairs Shortest Path Problem
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
On Algorithm for All-Pairs Most Reliable Quickest Paths
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Subquadratic Approximation Scheme for Partition
Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
