Approximating the Diameter of Planar Graphs in Near Linear Time
Abstract
We present a (1+ε)-approximation algorithm running in O(f(ε)· n 4 n) time for finding the diameter of an undirected planar graph with non-negative edge lengths.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.