Skip to main navigation Skip to search Skip to main content

Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    47 Scopus citations

    Abstract

    A (β, ϵ)-hopset for a weighted undirected n-vertex graph G = (V, E) is a set of edges, whose addition to the graph guarantees that every pair of vertices has a path between them that contains at most β edges, whose length is within 1 + ϵ of the shortest path. In her seminal paper, Cohen [8, JACM 2000] introduced the notion of hopsets in the context of parallel computation of approximate shortest paths, and since then it has found numerous applications in various other settings, such as dynamic graph algorithms, distributed computing, and the streaming model. Cohen [8] devised efficient algorithms for constructing hopsets with polylogarithmic in n number of hops. Her constructions remain the state-of-the-art since the publication of her paper in STOC'94, i.e., for more than two decades. In this paper we exhibit the first construction of sparse hopsets with a constant number of hops. We also find efficient algorithms for hopsets in various computational settings, improving the best known constructions. Generally, our hopsets strictly outperform the hopsets of [8], both in terms of their parameters, and in terms of the resources required to construct them. We demonstrate the applicability of our results for the fundamental problem of computing approximate shortest paths from s sources. Our results improve the running time for this problem in the parallel, distributed and streaming models, for a vast range of s.

    Original languageEnglish
    Title of host publicationProceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016
    PublisherInstitute of Electrical and Electronics Engineers
    Pages128-137
    Number of pages10
    ISBN (Electronic)9781509039333
    DOIs
    StatePublished - 14 Dec 2016
    Event57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016 - New Brunswick, United States
    Duration: 9 Oct 2016 → 11 Oct 2016

    Publication series

    NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
    Volume2016-December
    ISSN (Print)0272-5428

    Conference

    Conference57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016
    Country/TerritoryUnited States
    CityNew Brunswick
    Period9/10/16 → 11/10/16

    Keywords

    • Graphs
    • Hopsets
    • Shortest paths

    ASJC Scopus subject areas

    • General Computer Science

    Fingerprint

    Dive into the research topics of 'Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths'. Together they form a unique fingerprint.

    Cite this