Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs

Aaron Bernstein

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Fingerprint

    Dive into the research topics of 'Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs'. Together they form a unique fingerprint.

    Computer Science

    Keyphrases