{"paper":{"title":"Polynomial-time approximability of the k-Sink Location problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Naoki Katoh, R\\'emy Belmonte, Yoshio Okamoto, Yuya Higashikawa","submitted_at":"2015-03-10T09:52:52Z","abstract_excerpt":"A dynamic network ${\\cal N} = (G,c,\\tau,S)$ where $G=(V,E)$ is a graph, integers $\\tau(e)$ and $c(e)$ represent, for each edge $e\\in E$, the time required to traverse edge $e$ and its nonnegative capacity, and the set $S\\subseteq V$ is a set of sources. In the $k$-{\\sc Sink Location} problem, one is given as input a dynamic network ${\\cal N}$ where every source $u\\in S$ is given a nonnegative supply value $\\sigma(u)$. The task is then to find a set of sinks $X = \\{x_1,\\ldots,x_k\\}$ in $G$ that minimizes the routing time of all supply to $X$. Note that, in the case where $G$ is an undirected gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02835","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"}