{"paper":{"title":"New routing techniques and their applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Liam Roditty, Roei Tov","submitted_at":"2014-07-24T20:32:09Z","abstract_excerpt":"Let $G=(V,E)$ be an undirected graph with $n$ vertices and $m$ edges. We obtain the following new routing schemes:\n  - A routing scheme for unweighted graphs that uses $\\tilde O(\\frac{1}{\\epsilon} n^{2/3})$ space at each vertex and $\\tilde O(1/\\epsilon)$-bit headers, to route a message between any pair of vertices $u,v\\in V$ on a $(2 + \\epsilon,1)$-stretch path, i.e., a path of length at most $(2+\\epsilon)\\cdot d(u,v)+1$. This should be compared to the $(2,1)$-stretch and $\\tilde O(n^{5/3})$ space distance oracle of Patrascu and Roditty [FOCS'10 and SIAM J. Comput. 2014] and to the $(2,1)$-str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.6730","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"}