A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs

DOI10.1007/3-540-57155-8_269zbMath1504.68174MaRDI QIDQ5060135

Philip N. Klein, Sairam Subramanian

Publication date: 18 January 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-57155-8_269

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

68W25: Approximation algorithms

Related Items

Short and Simple Cycle Separators in Planar Graphs, Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps