View source for Publication:1001904

You do not have permission to edit this page, for the following reasons:

• The action you have requested is limited to users in the group: Users.
• You do not have permission to edit pages in the Publication namespace.

You can view and copy the source of this page.

Return to All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time.