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...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Maximilian Probst Gutenberg, Wulff-Nilsen, Christian
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 29.01.2020
Predmet:	Algorithms Clustering Data structures Emulators Graphs Query processing Run time (computers) Shortest-path problems
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!