6 citations · 10 across the 4 of their papers we have counts for
7 papers
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…
Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks
Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda +1
Evacuation in emergency situations can be modeled by a dynamic flow network. Two criteria have been used before: one is the evacuation completion time and the other is the aggregat…
Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities
Guru Prakash Arumugam, John Augustine, Mordecai J. Golin +3
A Dynamic Graph Network is a graph in which each edge has an associated travel time and a capacity (width) that limits the number of items that can travel in parallel along that ed…