This paper considers the problem of evacuating people located at vertices to a “sink” in a cycle network. In the “minmax-regret” version of this problem, the exact number of evacuees at each vertex is unknown, but only an interval for a possible number is given. We show that a minmax-regret 1-sink in cycle networks with uniform edge capacities can be found in O(n2) time, where n is the number of vertices. No correct algorithm was known before for this problem.
CITATION STYLE
Benkoczi, R., Bhattacharya, B., Higashikawa, Y., Kameda, T., & Katoh, N. (2019). Minmax-regret evacuation planning for cycle networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11436 LNCS, pp. 42–58). Springer Verlag. https://doi.org/10.1007/978-3-030-14812-6_4
Mendeley helps you to discover research relevant for your work.