{"id":"https://openalex.org/W2057082426","doi":"https://doi.org/10.1145/2591796.2591805","title":"Parallel algorithms for geometric graph problems","display_name":"Parallel algorithms for geometric graph problems","publication_year":2014,"publication_date":"2014-05-31","ids":{"openalex":"https://openalex.org/W2057082426","doi":"https://doi.org/10.1145/2591796.2591805","mag":"2057082426"},"language":"en","primary_location":{"id":"doi:10.1145/2591796.2591805","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2591796.2591805","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-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/A5088346829","display_name":"Alexandr Andoni","orcid":"https://orcid.org/0009-0004-8042-0976"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB","US"],"is_corresponding":true,"raw_author_name":"Alexandr Andoni","raw_affiliation_strings":["Microsoft Research","Microsoft research#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"Microsoft research#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053901790","display_name":"Aleksandar Nikolov","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]},{"id":"https://openalex.org/I4210096112","display_name":"Rutgers Sexual and Reproductive Health and Rights","ror":"https://ror.org/00rcvgx40","country_code":"NL","type":"other","lineage":["https://openalex.org/I4210096112"]}],"countries":["NL","US"],"is_corresponding":false,"raw_author_name":"Aleksandar Nikolov","raw_affiliation_strings":["Rutgers University","Rutgers, University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutgers University","institution_ids":["https://openalex.org/I4210096112"]},{"raw_affiliation_string":"Rutgers, University","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040763434","display_name":"Krzysztof Onak","orcid":"https://orcid.org/0000-0003-0226-7449"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Krzysztof Onak","raw_affiliation_strings":["IBM Research","IBM Research, -"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Research","institution_ids":[]},{"raw_affiliation_string":"IBM Research, -","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001984674","display_name":"Grigory Yaroslavtsev","orcid":null},"institutions":[{"id":"https://openalex.org/I175594653","display_name":"John Brown University","ror":"https://ror.org/02ct41q97","country_code":"US","type":"education","lineage":["https://openalex.org/I175594653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Grigory Yaroslavtsev","raw_affiliation_strings":["Brown University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University","institution_ids":["https://openalex.org/I175594653"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5088346829"],"corresponding_institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":5.0033,"has_fulltext":false,"cited_by_count":131,"citation_normalized_percentile":{"value":0.95967144,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"574","last_page":"583"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5848987698554993},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.5379159450531006},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.521879255771637},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5004632472991943},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4889358580112457},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.48851311206817627},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.44036608934402466},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4263227581977844},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4181596636772156},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3884141147136688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3347327709197998},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30201783776283264}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5848987698554993},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.5379159450531006},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.521879255771637},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5004632472991943},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4889358580112457},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.48851311206817627},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.44036608934402466},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4263227581977844},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4181596636772156},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3884141147136688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3347327709197998},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30201783776283264},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2591796.2591805","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2591796.2591805","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"},{"id":"https://openalex.org/F4320309070","display_name":"Brown University","ror":"https://ror.org/05gq02987"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W1503698146","https://openalex.org/W1568119442","https://openalex.org/W1598064945","https://openalex.org/W1605301393","https://openalex.org/W1868565867","https://openalex.org/W1972969203","https://openalex.org/W1981773323","https://openalex.org/W1991111385","https://openalex.org/W1992470151","https://openalex.org/W1992843866","https://openalex.org/W2001907516","https://openalex.org/W2004350101","https://openalex.org/W2007052372","https://openalex.org/W2008199814","https://openalex.org/W2027277859","https://openalex.org/W2027637765","https://openalex.org/W2028430839","https://openalex.org/W2034616054","https://openalex.org/W2045271686","https://openalex.org/W2047239272","https://openalex.org/W2051109346","https://openalex.org/W2051586153","https://openalex.org/W2053578961","https://openalex.org/W2069216960","https://openalex.org/W2074875917","https://openalex.org/W2082171780","https://openalex.org/W2095158239","https://openalex.org/W2100830825","https://openalex.org/W2101246692","https://openalex.org/W2104978738","https://openalex.org/W2105246008","https://openalex.org/W2110940003","https://openalex.org/W2118224498","https://openalex.org/W2127366419","https://openalex.org/W2143606444","https://openalex.org/W2143668817","https://openalex.org/W2144397897","https://openalex.org/W2148372359","https://openalex.org/W2149565746","https://openalex.org/W2153977620","https://openalex.org/W2165142526","https://openalex.org/W2169351022","https://openalex.org/W2169653785","https://openalex.org/W2173213060","https://openalex.org/W2247953682","https://openalex.org/W2340006107","https://openalex.org/W2397770138","https://openalex.org/W4239429564","https://openalex.org/W6690901460","https://openalex.org/W6704052874"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W2044443696","https://openalex.org/W1703428550","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1524692559"],"abstract_inverted_index":{"We":[0],"give":[1],"algorithms":[2,42],"for":[3,17,74,81],"geometric":[4],"graph":[5],"problems":[6],"in":[7,29,44,96],"the":[8,18,30,60,63,78],"modern":[9],"parallel":[10],"models":[11],"such":[12],"as":[13],"MapReduce.":[14],"For":[15],"example,":[16],"Minimum":[19],"Spanning":[20],"Tree":[21],"(MST)":[22],"problem":[23,90],"over":[24],"a":[25,36,45,87],"set":[26],"of":[27,48,50,62],"points":[28],"two-dimensional":[31],"space,":[32],"our":[33],"algorithm":[34],"computes":[35],"(1":[37],"+":[38],"\u03b5)-approximate":[39],"MST.":[40],"Our":[41],"work":[43],"constant":[46],"number":[47],"rounds":[49],"communication,":[51],"while":[52],"using":[53],"total":[54],"space":[55,66],"and":[56,67],"communication":[57],"proportional":[58],"to":[59],"size":[61],"data":[64],"(linear":[65],"near":[68],"linear":[69],"time":[70],"algorithms).":[71],"In":[72],"contrast,":[73],"general":[75],"graphs,":[76],"achieving":[77],"same":[79],"result":[80],"MST":[82],"(or":[83],"even":[84],"connectivity)":[85],"remains":[86],"challenging":[88],"open":[89],"[9],":[91],"despite":[92],"drawing":[93],"significant":[94],"attention":[95],"recent":[97],"years.":[98]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":12},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":24},{"year":2019,"cited_by_count":29},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":7}],"updated_date":"2026-04-26T08:31:28.666265","created_date":"2025-10-10T00:00:00"}