Back to Results
First PageMeta Content



Approximating the Diameter of Planar Graphs in Near Linear Time OREN WEIMANN and RAPHAEL YUSTER, University of Haifa We present a (1 + ε)-approximation algorithm running in O( f (ε) · n log4 n) time for finding the di
Add to Reading List

Document Date: 2016-03-09 08:46:36


Open Document

File Size: 267,62 KB

Share Result on Facebook
UPDATE