Skip to main content
SpringerLink
Log in

A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We present an \(O(n^3\sqrt{\log\log n}/\!\log n)\)-time algorithm for the All Pairs Shortest Paths (APSP) problem for directed graphs with real edge lengths. This slightly improves previous algorithms for the problem obtained by Fredman, Dobosiewicz, Han, and Takaoka.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel

    Uri Zwick

Authors
  1. Uri Zwick
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Uri Zwick.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zwick, U. A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths. Algorithmica 46, 181–192 (2006). https://doi.org/10.1007/s00453-005-1199-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-005-1199-1

Keywords

Search

Navigation