Approximating the diameter of planar graphs in near linear time

Research output: Contribution to journalArticlepeer-review


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

Original languageEnglish
Article number12
JournalACM Transactions on Algorithms
Issue number1
StatePublished - Nov 2015

Bibliographical note

Publisher Copyright:
© 2015 ACM.


  • All pairs shortest paths
  • Diameter
  • Distance oracles
  • Planar graphs

ASJC Scopus subject areas

  • Mathematics (miscellaneous)


Dive into the research topics of 'Approximating the diameter of planar graphs in near linear time'. Together they form a unique fingerprint.

Cite this