%0 Conference Paper %1 conf/isaac/BhattacharyaHKK18 %A Bhattacharya, Binay %A Higashikawa, Yuya %A Kameda, Tsunehiko %A Katoh, Naoki %B ISAAC %D 2018 %E Hsu, Wen-Lian %E Lee, Der-Tsai %E Liao, Chung-Shou %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 14:1-14:13 %T An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks. %U http://dblp.uni-trier.de/db/conf/isaac/isaac2018.html#BhattacharyaHKK18 %V 123 %@ 978-3-95977-094-1

@inproceedings{conf/isaac/BhattacharyaHKK18, added-at = {2019-05-02T00:00:00.000+0200}, author = {Bhattacharya, Binay and Higashikawa, Yuya and Kameda, Tsunehiko and Katoh, Naoki}, biburl = {https://www.bibsonomy.org/bibtex/25b6de416204118ba65b8e9d9f0a06633/dblp}, booktitle = {ISAAC}, crossref = {conf/isaac/2018}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, ee = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.14}, interhash = {e6d2c976dc1038b198800ae72c26e078}, intrahash = {5b6de416204118ba65b8e9d9f0a06633}, isbn = {978-3-95977-094-1}, keywords = {dblp}, pages = {14:1-14:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:43:10.000+0100}, title = {An O(n^2 log^2 n) Time Algorithm for Minmax Regret Minsum Sink on Path Networks.}, url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2018.html#BhattacharyaHKK18}, volume = 123, year = 2018 }