pdf-format: |
|
@InProceedings{bhattacharya_et_al:LIPIcs:2018:9962, author = {Binay Bhattacharya and Yuya Higashikawa and Tsunehiko Kameda and Naoki Katoh}, 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 = {Wen-Lian Hsu and Der-Tsai Lee and Chung-Shou Liao}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9962}, 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} }
Keywords: | Facility location, minsum sink, evacuation problem, minmax regret, dynamic flow path network | |
Seminar: | 29th International Symposium on Algorithms and Computation (ISAAC 2018) | |
Issue date: | 2018 | |
Date of publication: | 06.12.2018 |