{"paper":{"title":"Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernhard Haeupler, Goran Zuzic, Gramoz Goranci, Mingquan Ye, Xiaorui Sun","submitted_at":"2021-10-29T17:48:05Z","abstract_excerpt":"We provide universally-optimal distributed graph algorithms for $(1+\\varepsilon)$-approximate shortest path problems including shortest-path-tree and transshipment.\n  The universal optimality of our algorithms guarantees that, on any $n$-node network $G$, our algorithm completes in $T \\cdot n^{o(1)}$ rounds whenever a $T$-round algorithm exists for $G$. This includes $D \\cdot n^{o(1)}$-round algorithms for any planar or excluded-minor network. Our algorithms never require more than $(\\sqrt{n} + D) \\cdot n^{o(1)}$ rounds, resulting in the first sub-linear-round distributed algorithm for transsh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.15944","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.15944/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}