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

Weimann, Oren

Yuster, Raphael

English

arXiv

We present a (1 + ε)-approximation algorithm running in O( f (ε) · n log 4 n) time for finding the diameter of an undirected planar graph with n vertices and with nonnegative edge lengths

Approximating the Diameter of Planar Graphs in Near Linear Time

Abstract

Similar works

Full text

Available Versions

CiteSeerX