6 citations · 19 across the 18 of their papers we have counts for
20 papers
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…
Almost Linear Time Algorithms for Minsum -Sink Problems on Dynamic Flow Path Networks
Yuya Higashikawa, Naoki Katoh, Junichi Teruyama +1
We address the facility location problems on dynamic flow path networks. A dynamic flow path network consists of an undirected path with positive edge lengths, positive edge capaci…
On Computing a Center Persistence Diagram
Yuya Higashikawa, Naoki Katoh, Guohui Lin +4
Throughout this paper, a persistence diagram is composed of a set of planar points (each corresponding to a topological feature) above the line , as well as the…
Minsum -Sink Problem on Path Networks
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa +2
We consider the problem of locating a set of sinks on a path network with general edge capacities that minimizes the sum of the evacuation times of all evacuees. We first prese…