Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler

In the decremental \((1+\epsilon)\)-approximate Single-Source Shortest Path (SSSP) problem, we are given a graph \(G=(V,E)\) with \(n = |V|, m = |E|\), undergoing edge deletions, and a distinguished source \(s \in V\), and we are asked to process edge deletions efficiently and answer queries for dis...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Maximilian Probst Gutenberg, Wulff-Nilsen, Christian
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 29.01.2020
Subjects:	Algorithms Clustering Data structures Emulators Graphs Query processing Run time (computers) Shortest-path problems
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!