Maximilian Probst Gutenberg, Virginia Vassilevska Williams, Nicole Wein. New algorithms and hardness for incremental single-source shortest paths in directed graphs. In Konstantin Makarychev, Yury Makarychev, Madhur Tulsiani, Gautam Kamath 0001, Julia Chuzhoy, editors, Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020. pages 153-166, ACM, 2020. [doi]
@inproceedings{GutenbergWW20,
title = {New algorithms and hardness for incremental single-source shortest paths in directed graphs},
author = {Maximilian Probst Gutenberg and Virginia Vassilevska Williams and Nicole Wein},
year = {2020},
doi = {10.1145/3357713.3384236},
url = {https://doi.org/10.1145/3357713.3384236},
researchr = {https://researchr.org/publication/GutenbergWW20},
cites = {0},
citedby = {0},
pages = {153-166},
booktitle = {Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020},
editor = {Konstantin Makarychev and Yury Makarychev and Madhur Tulsiani and Gautam Kamath 0001 and Julia Chuzhoy},
publisher = {ACM},
isbn = {978-1-4503-6979-4},
}