A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
Algorithmica1998Vol. 22(3), pp. 235–249
Citations Over Time
Related Papers
- → An approximation algorithm for the traveling tournament problem(2010)26 cited
- → Approximation Algorithms for Facial Cycles in Planar Embeddings(2018)2 cited
- → Berechnung und programm. I(1972)51 cited
- → A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties(2012)3 cited
- → Multi-Objective Shortest Path Model for Optimal Route between Commercial Cities on America(2019)1 cited