Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All \({\ell_{{p}}}\) Norms
- PAR ID:
- 10558916
- Publisher / Repository:
- Society for Industrial and Applied Mathematics (SIAM)
- Date Published:
- Journal Name:
- SIAM Journal on Computing
- Volume:
- 53
- Issue:
- 5
- ISSN:
- 0097-5397
- Page Range / eLocation ID:
- 1439 to 1475
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Algorithms for computing All-Pairs Shortest-Paths (APSP) are critical building blocks underlying many practical applications. The standard sequential algorithms, such as Floyd-Warshall and Johnson, quickly become infeasible for large input graphs, necessitating parallel approaches. In this work, we propose, implement and thoroughly analyse different strategies for APSP on distributed memory clusters with Apache Spark. Our solvers are designed for large undirected weighted graphs, and differ in complexity and degree of reliance on techniques outside of pure Spark API. We demonstrate that the best performing solver is able to handle APSP problems with over 200,000 vertices on a 1024-core cluster. However, it requires auxiliary shared persistent storage to compensate for missing Spark functionality.more » « less
An official website of the United States government

