Gutenberg, M. P., & Wulff-Nilsen, C. (2020, January 29). Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler. arXiv.org. https://doi.org/10.48550/arxiv.2001.10809
Chicago Style (17th ed.) CitationGutenberg, Maximilian Probst, and Christian Wulff-Nilsen. "Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler." ArXiv.org 29 Jan. 2020. https://doi.org/10.48550/arxiv.2001.10809.
MLA (9th ed.) CitationGutenberg, Maximilian Probst, and Christian Wulff-Nilsen. "Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler." ArXiv.org, 29 Jan. 2020, https://doi.org/10.48550/arxiv.2001.10809.
Warning: These citations may not always be 100% accurate.