{"id":"https://openalex.org/W1597730645","doi":"https://doi.org/10.1145/2764910","title":"Approximating the Diameter of Planar Graphs in Near Linear Time","display_name":"Approximating the Diameter of Planar Graphs in Near Linear Time","publication_year":2015,"publication_date":"2015-11-16","ids":{"openalex":"https://openalex.org/W1597730645","doi":"https://doi.org/10.1145/2764910","mag":"1597730645"},"language":"en","primary_location":{"id":"doi:10.1145/2764910","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2764910","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000569191","display_name":"Oren Weimann","orcid":"https://orcid.org/0000-0002-4510-7552"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Oren Weimann","raw_affiliation_strings":["University of Haifa, Haifa, Israel",", University of Haifa, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]},{"raw_affiliation_string":", University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026016357","display_name":"Raphael Yuster","orcid":"https://orcid.org/0000-0001-7550-6506"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Raphael Yuster","raw_affiliation_strings":["University of Haifa, Haifa, Israel",", University of Haifa, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]},{"raw_affiliation_string":", University of Haifa, Haifa, Israel","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000569191"],"corresponding_institution_ids":["https://openalex.org/I91203450"],"apc_list":null,"apc_paid":null,"fwci":2.1031,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.87050217,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"13"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7446111440658569},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.6866146922111511},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.6685092449188232},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6674976348876953},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6549063324928284},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5341383814811707},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49070537090301514},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.47991856932640076},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4507380723953247},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42837047576904297},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4121338427066803},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3708048462867737},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22552156448364258},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2079836130142212},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07185426354408264}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7446111440658569},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.6866146922111511},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6685092449188232},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6674976348876953},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6549063324928284},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5341383814811707},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49070537090301514},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.47991856932640076},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4507380723953247},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42837047576904297},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4121338427066803},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3708048462867737},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22552156448364258},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2079836130142212},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07185426354408264},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2764910","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2764910","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1530560842","https://openalex.org/W1547799421","https://openalex.org/W1598532264","https://openalex.org/W1608550999","https://openalex.org/W1965690159","https://openalex.org/W1988067232","https://openalex.org/W1989214692","https://openalex.org/W2000303018","https://openalex.org/W2003457914","https://openalex.org/W2022980325","https://openalex.org/W2038643780","https://openalex.org/W2047489708","https://openalex.org/W2064790310","https://openalex.org/W2078443814","https://openalex.org/W2096304547","https://openalex.org/W2102564932","https://openalex.org/W2111977969","https://openalex.org/W2120424341","https://openalex.org/W2142780976","https://openalex.org/W2150410057","https://openalex.org/W2182608044","https://openalex.org/W2250978763","https://openalex.org/W2762935521","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W2906860838","https://openalex.org/W2113270940","https://openalex.org/W2147954430","https://openalex.org/W2004283824","https://openalex.org/W1995738188","https://openalex.org/W2963158951","https://openalex.org/W2070751425","https://openalex.org/W2023670982","https://openalex.org/W1604162242","https://openalex.org/W2031552172"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2],"(1":[3],"+":[4],"\u03b5)-approximation":[5],"algorithm":[6],"running":[7],"in":[8],"O":[9],"(":[10],"f":[11],"(\u03b5)":[12],"\u00b7":[13],"n":[14,17,30],"log":[15],"4":[16],")":[18],"time":[19],"for":[20],"finding":[21],"the":[22],"diameter":[23],"of":[24],"an":[25],"undirected":[26],"planar":[27],"graph":[28],"with":[29,33],"vertices":[31],"and":[32],"nonnegative":[34],"edge":[35],"lengths.":[36]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}