3 citations · 4 across the 5 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023
Faster Algorithms for Evacuation Problems in Networks with the Single Sink of Small Degree
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama +1
In this paper, we propose new algorithms for evacuation problems defined on dynamic flow networks. A dynamic flow network is a directed graph in which source nodes are given suppli…
cs.DS2016
Improved Algorithms for Computing -Sink on Dynamic Path Networks
Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa +2
We present a novel approach to finding the -sink on dynamic path networks with general edge capacities. Our first algorithm runs in time, where …
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…