Polynomial-time approximability of the k-Sink Location problem

Rémy Belmonte, Yuya Higashikawa, Naoki Katoh +1

A dynamic network $\mathcal{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 no…