An O(n3log⁡log⁡n/log2⁡n) time algorithm for all pairs shortest paths

We present an O(n3log⁡log⁡n/log2⁡n) time algorithm for all pairs shortest paths. This algorithm improves on the best previous result of O(n3(log⁡log⁡n)3/log2⁡n) time.