Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees

Let G be an n -node and m -edge positively real-weighted undirected graph. For any given integer f ≥ 1 , we study the problem of designing a sparse f -edge-fault-tolerant ( f -EFT) σ -approximate single-source shortest-path tree ( σ -ASPT), namely a subgraph of G having as few edges as possible and...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 84; číslo 1; s. 37 - 59
Hlavní autori:	Bilò, Davide, Gualà, Luciano, Leucci, Stefano, Proietti, Guido
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.01.2022 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Fault tolerance Graph theory Integers Lower bounds Mathematics of Computing Shortest-path problems Theory of Computation Trees (mathematics) 68P05 68W40 Fully-dynamic minimum spanning tree Distance sensitivity oracle Multiple-edge fault-tolerant shortest-path tree
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!