{"paper":{"title":"On Routing Disjoint Paths in Bounded Treewidth Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alina Ene, Andrej Risteski, Marcin Pilipczuk, Matthias Mnich","submitted_at":"2015-12-06T20:35:37Z","abstract_excerpt":"We study the problem of routing on disjoint paths in bounded treewidth graphs with both edge and node capacities. The input consists of a capacitated graph $G$ and a collection of $k$ source-destination pairs $\\mathcal{M} = \\{(s_1, t_1), \\dots, (s_k, t_k)\\}$. The goal is to maximize the number of pairs that can be routed subject to the capacities in the graph. A routing of a subset $\\mathcal{M}'$ of the pairs is a collection $\\mathcal{P}$ of paths such that, for each pair $(s_i, t_i) \\in \\mathcal{M}'$, there is a path in $\\mathcal{P}$ connecting $s_i$ to $t_i$. In the Maximum Edge Disjoint Pat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01829","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":""},"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"}