Approximating the Diameter of Planar Graphs in Near Linear Time
Abstract
We present a $(1+\epsilon)$-approximation algorithm running in $O(f(\epsilon)\cdot n \log^4 n)$ time for finding the diameter of an undirected planar graph with non-negative edge lengths.
- Publication:
-
arXiv e-prints
- Pub Date:
- December 2011
- DOI:
- 10.48550/arXiv.1112.1116
- arXiv:
- arXiv:1112.1116
- Bibcode:
- 2011arXiv1112.1116W
- Keywords:
-
- Computer Science - Data Structures and Algorithms