@InProceedings{bhattacharya_et_al:LIPIcs.ISAAC.2018.14,
author = {Bhattacharya, Binay and Higashikawa, Yuya and Kameda, Tsunehiko and Katoh, Naoki},
title = {{An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks}},
booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)},
pages = {14:1--14:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-094-1},
ISSN = {1868-8969},
year = {2018},
volume = {123},
editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.14},
URN = {urn:nbn:de:0030-drops-99624},
doi = {10.4230/LIPIcs.ISAAC.2018.14},
annote = {Keywords: Facility location, minsum sink, evacuation problem, minmax regret, dynamic flow path network}
}