1 citations · 1 across the 4 of their papers we have counts for
4 papers
Sink Location Problems in Dynamic Flow Grid Networks
Yuya Higashikawa, Ayano Nishii, Junichi Teruyama +1
A dynamic flow network consists of a directed graph, where nodes called sources represent locations of evacuees, and nodes called sinks represent locations of evacuation facilities…
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…
The Two-Squirrel Problem and Its Relatives
Sergey Bereg, Yuya Higashikawa, Naoki Katoh +3
In this paper, we start with a variation of the star cover problem called the Two-Squirrel problem. Given a set of points in the plane, and two sites and , comp…
Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights
Tetsuya Fujie, Yuya Higashikawa, Naoki Katoh +2
This paper addresses the minmax regret 1-sink location problem on dynamic flow path networks with parametric weights. We are given a dynamic flow network consisting of an undirecte…