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 - Planar graphs - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2016-03-09 08:46:36		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 Source URL: www.cs.haifa.ac.il Download Document from Source Website File Size: 267,62 KB Share Document on Facebook