All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exponent of all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Linear Time Construction of Sparse Neighborhood Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Approximation of Distances in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: More algorithms for all-pairs shortest paths in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Constructing t-Spanners and Paths with Stretch t / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylog-time and near-linear work approximation scheme for undirected shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Small-Stretch Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Almost Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing almost shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to all-pairs shortest paths on real-weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcubic cost algorithms for the all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate distance oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest paths using bridging sets and rectangular matrix multiplication / rank
 
Normal rank

Latest revision as of 01:33, 29 June 2024

scientific article
Language Label Description Also known as
English
All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time
scientific article

    Statements

    All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (English)
    0 references
    0 references
    0 references
    0 references
    19 February 2009
    0 references
    shortest path
    0 references
    distance
    0 references
    spanner
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references