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 diAdd to Reading ListSource URL: www.cs.haifa.ac.ilDownload Document from Source WebsiteFile Size: 267,62 KBShare Document on Facebook |