A dynamic flow network consists of a directed graph, where nodes called
...
In this paper, we start with a variation of the star cover problem calle...
In this paper, we propose new algorithms for evacuation problems defined...
This paper addresses the minmax regret 1-sink location problem on dynami...
We address the facility location problems on dynamic flow path networks....
Given a set of persistence diagrams P_1,..., P_m, for the data
reduction...
We consider the problem of locating a set of k sinks on a path network w...
Evacuation in emergency situations can be modeled by a dynamic flow netw...