{"id":"https://openalex.org/W2100812758","doi":"https://doi.org/10.1145/1400751.1400787","title":"Efficient distributed approximation algorithms via probabilistic tree embeddings","display_name":"Efficient distributed approximation algorithms via probabilistic tree embeddings","publication_year":2008,"publication_date":"2008-08-18","ids":{"openalex":"https://openalex.org/W2100812758","doi":"https://doi.org/10.1145/1400751.1400787","mag":"2100812758"},"language":"en","primary_location":{"id":"doi:10.1145/1400751.1400787","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1400751.1400787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-seventh ACM symposium on Principles of distributed 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/A5104069467","display_name":"Maleq Khan","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Maleq Khan","raw_affiliation_strings":["VBI, Virginia Tech, Blacksburg, VA, USA"],"affiliations":[{"raw_affiliation_string":"VBI, Virginia Tech, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023808567","display_name":"Fabian K\u00fchn","orcid":"https://orcid.org/0000-0002-1025-5037"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Fabian Kuhn","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038903572","display_name":"Dahlia Malkhi","orcid":"https://orcid.org/0000-0002-7038-7250"},"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dahlia Malkhi","raw_affiliation_strings":["Microsoft Research, Mountain view, CA, USA","Microsoft Research, Mountain View, CA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Mountain view, CA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research, Mountain View, CA, USA#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089574654","display_name":"Gopal Pandurangan","orcid":"https://orcid.org/0000-0001-5833-6592"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gopal Pandurangan","raw_affiliation_strings":["Purdue University, West Lafayette, IN, USA"],"affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080065269","display_name":"Kunal Talwar","orcid":null},"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kunal Talwar","raw_affiliation_strings":["Microsoft Research, Mountain View, CA, USA","Microsoft Research, Mountain View, CA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Mountain View, CA, USA","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Microsoft Research, Mountain View, CA, USA#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5104069467"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":1.2016,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.80724455,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"263","last_page":"272"},"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.9995999932289124,"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.9995999932289124,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/probabilistic-logic","display_name":"Probabilistic logic","score":0.7702324390411377},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.7674353122711182},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.7587868571281433},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6532632112503052},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5785572528839111},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.574178159236908},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5502347350120544},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5299837589263916},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5267999768257141},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5065511465072632},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.4686039686203003},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.46747633814811707},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4653972089290619},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4367208182811737},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4209679961204529},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3428618013858795},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2529815435409546},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21018895506858826},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.19482070207595825},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08061662316322327}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7702324390411377},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.7674353122711182},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7587868571281433},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6532632112503052},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5785572528839111},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.574178159236908},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5502347350120544},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5299837589263916},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5267999768257141},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5065511465072632},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.4686039686203003},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.46747633814811707},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4653972089290619},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4367208182811737},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4209679961204529},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3428618013858795},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2529815435409546},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21018895506858826},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.19482070207595825},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08061662316322327},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1400751.1400787","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1400751.1400787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","score":0.7200000286102295,"id":"https://metadata.un.org/sdg/15"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W137614736","https://openalex.org/W647522939","https://openalex.org/W1523785148","https://openalex.org/W1534484868","https://openalex.org/W1568961751","https://openalex.org/W1578705518","https://openalex.org/W1945440063","https://openalex.org/W1952648253","https://openalex.org/W1965765215","https://openalex.org/W1965996575","https://openalex.org/W1984090926","https://openalex.org/W1987669032","https://openalex.org/W1998137177","https://openalex.org/W2002296715","https://openalex.org/W2025827262","https://openalex.org/W2026210405","https://openalex.org/W2027082532","https://openalex.org/W2030982625","https://openalex.org/W2041571997","https://openalex.org/W2041907251","https://openalex.org/W2046018957","https://openalex.org/W2053788000","https://openalex.org/W2058191123","https://openalex.org/W2077371116","https://openalex.org/W2082353536","https://openalex.org/W2090222354","https://openalex.org/W2114493937","https://openalex.org/W2118005842","https://openalex.org/W2126356486","https://openalex.org/W2129295346","https://openalex.org/W2136604606","https://openalex.org/W2151757686","https://openalex.org/W2163097371","https://openalex.org/W2165441947","https://openalex.org/W2172178473","https://openalex.org/W2405263596","https://openalex.org/W2611804663","https://openalex.org/W3030774092","https://openalex.org/W4205300528","https://openalex.org/W4285719527","https://openalex.org/W4300273322","https://openalex.org/W4300550233","https://openalex.org/W6844382842"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W3081212354"],"abstract_inverted_index":{"We":[0,35],"present":[1],"a":[2,23,46,92],"uniform":[3],"approach":[4,17],"to":[5,28,38,51,55],"design":[6],"efficient":[7],"distributed":[8,60],"approximation":[9],"algorithms":[10,61,89],"for":[11,62],"various":[12],"network":[13],"optimization":[14],"problems.":[15],"Our":[16],"is":[18],"randomized":[19],"and":[20,31,49,75],"based":[21],"on":[22],"probabilistic":[24],"tree":[25,73],"embedding":[26,44,54],"due":[27],"Fakcharoenphol,":[29],"Rao,":[30],"Talwar":[32],"(FRT":[33],"embedding).":[34],"show":[36],"how":[37,50],"efficiently":[39],"compute":[40],"an":[41],"(implicit)":[42],"FRT":[43],"in":[45,81],"decentralized":[47],"manner":[48],"use":[52],"the":[53,63,68,76,96],"obtain":[56],"expected":[57],"O(log":[58],"n)-approximate":[59],"generalized":[64],"Steiner":[65],"forest":[66],"problem,":[67,74],"minimum":[69],"routing":[70],"cost":[71],"spanning":[72],"$k$-source":[77],"shortest":[78],"paths":[79],"problem":[80],"arbitrary":[82],"networks.":[83],"The":[84],"time":[85],"complexities":[86],"of":[87,95],"our":[88],"are":[90],"within":[91],"polylogarithmic":[93],"factor":[94],"optimum.":[97]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}