scientific article; zbMATH DE number 7053270
From MaRDI portal
Publication:5743389
zbMath1422.68197arXiv1109.4156MaRDI QIDQ5743389
Publication date: 10 May 2019
Full work available at URL: https://arxiv.org/abs/1109.4156
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items (11)
Distance oracles for time-dependent networks ⋮ Optimal (Euclidean) Metric Compression ⋮ Efficient vertex-label distance oracles for planar graphs ⋮ Space-efficient path-reporting approximate distance oracles ⋮ Efficient dynamic approximate distance oracles for vertex-labeled planar graphs ⋮ Unnamed Item ⋮ Close to linear space routing schemes ⋮ Constructing Light Spanners Deterministically in Near-Linear Time ⋮ Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs ⋮ Constructing light spanners deterministically in near-linear time ⋮ An axiomatic approach to time-dependent shortest path oracles
Cites Work
- Unnamed Item
- Unnamed Item
- Ramsey partitions and proximity data structures
- A new approach to all-pairs shortest paths on real-weighted graphs
- All-Pairs Small-Stretch Paths
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- More algorithms for all-pairs shortest paths in weighted graphs
- Spanners and emulators with sublinear distance errors
- Approximating Shortest Paths in Graphs
- $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
- All-Pairs Almost Shortest Paths
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
- Distance Oracles beyond the Thorup--Zwick Bound
- Automata, Languages and Programming
This page was built for publication:
