Naoki Katoh

most citedImproved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks

3 citations · 4 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DS2016

Improved Algorithms for Computing $k$ -Sink on Dynamic Path Networks

Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa +2

We present a novel approach to finding the $k$ -sink on dynamic path networks with general edge capacities. Our first algorithm runs in $O (n lo g n + k^{2} lo g^{4} n)$ time, where $n$ …

cs.DS2014★ 3 cited

Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks

Yuya Higashikawa, Mordecai J. Golin, Naoki Katoh

This paper considers the k-sink location problem in dynamic path networks. In our model, a dynamic path network consists of an undirected path with positive edge lengths, uniform e…

math.CO2014★ 1 cited

Extended Formulations for Sparsity Matroids

Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh +2

We show the existence of a polynomial-size extended formulation for the base polytope of a $(k, ℓ)$ -sparsity matroid. For an undirected graph $G = (V, E)$ , the size of the formulati…

Improved Algorithms for Computing k-Sink on Dynamic Path Networks

Improved Algorithms for Multiple Sink Location Problems in Dynamic Path Networks

Extended Formulations for Sparsity Matroids

Improved Algorithms for Computing $k$ -Sink on Dynamic Path Networks