{"id":"https://openalex.org/W2136425424","doi":"https://doi.org/10.1007/11864219_25","title":"A Fast Distributed Approximation Algorithm for Minimum Spanning Trees","display_name":"A Fast Distributed Approximation Algorithm for Minimum Spanning Trees","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2136425424","doi":"https://doi.org/10.1007/11864219_25","mag":"2136425424"},"language":"en","primary_location":{"id":"doi:10.1007/11864219_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11864219_25","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/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":true,"raw_author_name":"Maleq Khan","raw_affiliation_strings":["Department of Computer Science, Purdue University, West Lafayette, USA","Department of Computer Science, Purdue University, West Lafayette IN#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette IN#TAB#","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","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":["Department of Computer Science, Purdue University, West Lafayette, USA","Department of Computer Science, Purdue University, West Lafayette IN#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette IN#TAB#","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5104069467"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.7655,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.93533441,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"355","last_page":"369"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.996999979019165,"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/spanning-tree","display_name":"Spanning tree","score":0.7621895670890808},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6814920902252197},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.629621148109436},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6212065815925598},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5905227661132812},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5901613831520081},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5900723338127136},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5682721734046936},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5286978483200073},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.46839213371276855},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46566227078437805},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44999635219573975},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44011369347572327},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43954670429229736},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4372372329235077},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4273008108139038},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39626869559288025},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2137952744960785}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7621895670890808},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6814920902252197},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.629621148109436},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6212065815925598},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5905227661132812},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5901613831520081},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5900723338127136},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5682721734046936},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5286978483200073},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.46839213371276855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46566227078437805},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44999635219573975},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44011369347572327},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43954670429229736},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4372372329235077},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4273008108139038},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39626869559288025},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2137952744960785},{"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.1007/11864219_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11864219_25","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1534484868","https://openalex.org/W1568961751","https://openalex.org/W1945440063","https://openalex.org/W1985361054","https://openalex.org/W1987099434","https://openalex.org/W2015077309","https://openalex.org/W2022179164","https://openalex.org/W2029437526","https://openalex.org/W2030982625","https://openalex.org/W2032607682","https://openalex.org/W2053788000","https://openalex.org/W2053981136","https://openalex.org/W2077371116","https://openalex.org/W2084206787","https://openalex.org/W2088374619","https://openalex.org/W2091422818","https://openalex.org/W2100466311","https://openalex.org/W2103012681","https://openalex.org/W2136604606","https://openalex.org/W2151757686","https://openalex.org/W2161318588","https://openalex.org/W2163097371","https://openalex.org/W2172178473","https://openalex.org/W2752885492","https://openalex.org/W2956015669","https://openalex.org/W3145128584","https://openalex.org/W4205300528","https://openalex.org/W4238472918","https://openalex.org/W4311017726"],"related_works":["https://openalex.org/W4297934114","https://openalex.org/W1945942196","https://openalex.org/W2135993528","https://openalex.org/W1533802153","https://openalex.org/W2145492278","https://openalex.org/W2396151227","https://openalex.org/W2136425424","https://openalex.org/W4300466094","https://openalex.org/W2466618562","https://openalex.org/W2047460174"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}