{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:15:38Z","timestamp":1750306538665,"version":"3.41.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T00:00:00Z","timestamp":1447632000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2016,2,8]]},"abstract":"<jats:p>\n            We present a (1 + \u03b5)-approximation algorithm running in\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>f<\/jats:italic>\n            (\u03b5) \u00b7\n            <jats:italic>n<\/jats:italic>\n            log\u2009\n            <jats:sup>4<\/jats:sup>\n            <jats:italic>n<\/jats:italic>\n            ) time for finding the diameter of an undirected planar graph with\n            <jats:italic>n<\/jats:italic>\n            vertices and with nonnegative edge lengths.\n          <\/jats:p>","DOI":"10.1145\/2764910","type":"journal-article","created":{"date-parts":[[2015,11,18]],"date-time":"2015-11-18T13:42:28Z","timestamp":1447854148000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Approximating the Diameter of Planar Graphs in Near Linear Time"],"prefix":"10.1145","volume":"12","author":[{"given":"Oren","family":"Weimann","sequence":"first","affiliation":[{"name":"University of Haifa, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael","family":"Yuster","sequence":"additional","affiliation":[{"name":"University of Haifa, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,11,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146411"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796303421"},{"volume-title":"Proceedings of the 10th International Workshop on Algorithms and Data Structures (WADS). 541--552","author":"Berman P.","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11764298_9"},{"volume-title":"Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Mathematics (SODA). 1041--1052","author":"Chechik S.","key":"e_1_2_1_5_1"},{"volume-title":"Proceedings of the 2nd Annual European Symposium on Algorithms (ESA). 159--170","author":"Chepoi V.","key":"e_1_2_1_6_1"},{"volume-title":"Congressus Numerantium 60","year":"1987","author":"Chung F. R. K.","key":"e_1_2_1_7_1"},{"volume-title":"Proceedings of International Workshop on Graph-Theoretic Concepts in Computer Science (WG). 166--180","author":"Dragan F. F.","key":"e_1_2_1_8_1"},{"volume-title":"Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 632--640","year":"1995","author":"Eppstein D.","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(80)90039-6"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216064"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480190177042"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1493"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"volume-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Mathematics (SODA). 820--827","year":"2002","author":"Klein P. N.","key":"e_1_2_1_15_1"},{"volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Mathematics (SODA). 146--155","year":"2005","author":"Klein P. N.","key":"e_1_2_1_16_1"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207169008803870"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684572"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488673"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039493"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591811"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764910","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2764910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:23Z","timestamp":1750227143000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2764910"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,16]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,2,8]]}},"alternative-id":["10.1145\/2764910"],"URL":"https:\/\/doi.org\/10.1145\/2764910","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"type":"print","value":"1549-6325"},{"type":"electronic","value":"1549-6333"}],"subject":[],"published":{"date-parts":[[2015,11,16]]},"assertion":[{"value":"2013-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-11-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}