Approximate shortest paths guided by a small index

DOI10.1007/s00453-008-9228-5zbMath1209.68362OpenAlexW2034707455MaRDI QIDQ973004

Jörg Derungs, Riko Jacob, Peter Widmayer

Publication date: 28 May 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9228-5

zbMATH Keywords

graph spannerdistance oracleapproximate shortest path

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On sparse spanners of weighted graphs
• Approximate distance oracles
• Graph spanners
• A Greedy Heuristic for the Set-Covering Problem
• Reachability and Distance Queries via 2-Hop Labels
• Approximate distance oracles
• Algorithms – ESA 2005
• Algorithms - ESA 2003
• Trading off space for passes in graph streaming problems