The Shortcut Problem – Complexity and Approximation
From MaRDI portal
Publication:3599067
DOI10.1007/978-3-540-95891-8_13zbMath1206.68226OpenAlexW1505815330MaRDI QIDQ3599067
Daniel Delling, Gianlorenzo D'Angelo, Reinhard Bauer, Dorothea Wagner
Publication date: 3 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_13
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items
Uses Software
Cites Work
- Experimental algorithms. 7th international workshop, WEA 2008 Provincetown, MA, USA, May 30--June 1, 2008. Proceedings
- Dynamic multi-level overlay graphs for shortest paths
- Experimental algorithms. 6th international workshop, WEA 2007, Rome, Italy, June 6--8, 2007. Proceedings.
- On the Distribution of the Number of Successes in Independent Trials
- Speed-Up Techniques for Shortest-Path Computations
- Engineering multilevel overlay graphs for shortest-path queries
- SHARC
- Engineering Highway Hierarchies
- Dijkstra's algorithm on-line
- Unnamed Item