Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time

Jan van den Brand, Danupon Nanongkai. Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. In David Zuckerman, editor, 60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019, Baltimore, Maryland, USA, November 9-12, 2019. pages 436-455, IEEE Computer Society, 2019. [doi]

Abstract

Abstract is missing.