{"id":"https://openalex.org/W2736824089","doi":"https://doi.org/10.1145/3087801.3087842","title":"Brief Announcement","display_name":"Brief Announcement","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2736824089","doi":"https://doi.org/10.1145/3087801.3087842","mag":"2736824089"},"language":"en","primary_location":{"id":"doi:10.1145/3087801.3087842","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801.3087842","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 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/A5061279024","display_name":"Keren Censor-Hillel","orcid":"https://orcid.org/0000-0003-4395-5205"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Keren Censor-Hillel","raw_affiliation_strings":["Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052412504","display_name":"Michal Dory","orcid":"https://orcid.org/0000-0002-8565-9642"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michal Dory","raw_affiliation_strings":["Technion, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061279024"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12300057,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"199","last_page":"201"},"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.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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.9973000288009644,"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.7633926272392273},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7415416836738586},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.633898138999939},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.6177484393119812},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.5970842242240906},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5427073240280151},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5013902187347412},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4923909902572632},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47690272331237793},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.44905003905296326},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4387426972389221},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.41709619760513306},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41178637742996216},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3970396816730499},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3156692385673523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27551010251045227},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2739903926849365},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2057664692401886},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13981059193611145},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.1026594340801239}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7633926272392273},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7415416836738586},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.633898138999939},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.6177484393119812},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.5970842242240906},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5427073240280151},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5013902187347412},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4923909902572632},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47690272331237793},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.44905003905296326},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4387426972389221},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.41709619760513306},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41178637742996216},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3970396816730499},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3156692385673523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27551010251045227},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2739903926849365},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2057664692401886},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13981059193611145},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.1026594340801239},{"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/3087801.3087842","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801.3087842","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2805638855","display_name":null,"funder_award_id":"1696/14","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1568961751","https://openalex.org/W1596370873","https://openalex.org/W1974912205","https://openalex.org/W1980229659","https://openalex.org/W1984090926","https://openalex.org/W1986478184","https://openalex.org/W1989224473","https://openalex.org/W2002452451","https://openalex.org/W2005900781","https://openalex.org/W2007004331","https://openalex.org/W2015819397","https://openalex.org/W2029830880","https://openalex.org/W2030982625","https://openalex.org/W2049754879","https://openalex.org/W2051699458","https://openalex.org/W2053788000","https://openalex.org/W2067818080","https://openalex.org/W2077371116","https://openalex.org/W2083323175","https://openalex.org/W2092113566","https://openalex.org/W2128823163","https://openalex.org/W2135211390","https://openalex.org/W2142542622","https://openalex.org/W2153507546","https://openalex.org/W2163097371","https://openalex.org/W2172955861","https://openalex.org/W2287418059","https://openalex.org/W2467525240","https://openalex.org/W3147804948","https://openalex.org/W4205300528","https://openalex.org/W4234462414","https://openalex.org/W4298853332"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2387385213","https://openalex.org/W2138987445","https://openalex.org/W2943635264","https://openalex.org/W2518240130","https://openalex.org/W4242086819","https://openalex.org/W2074214908","https://openalex.org/W2014991506","https://openalex.org/W2099915933","https://openalex.org/W3016811403"],"abstract_inverted_index":{"A":[0],"minimum":[1,71,73],"spanning":[2,57],"tree":[3,58],"(MST)":[4],"is":[5,14,51,65],"an":[6,21],"essential":[7],"structure":[8],"for":[9,47],"distributed":[10],"algorithms,":[11],"since":[12],"it":[13],"a":[15,27,52,56,70,89],"low-cost":[16],"connected":[17,87],"subgraph":[18],"which":[19,48],"provides":[20],"efficient":[22],"way":[23],"to":[24,66],"communicate":[25],"in":[26],"network.":[28],"However,":[29],"trees":[30],"cannot":[31],"survive":[32],"even":[33],"one":[34],"link":[35],"failure.":[36],"In":[37],"this":[38],"paper,":[39],"we":[40],"study":[41],"the":[42,49,63],"Tree":[43],"Augmentation":[44],"Problem":[45],"(TAP),":[46],"input":[50],"graph":[53],"G":[54,61],"and":[55,62],"T":[59,68,83],"of":[60,76,91],"goal":[64],"augment":[67],"with":[69],"(or":[72],"weight)":[74],"set":[75],"edges":[77],"Aug":[78,85],"from":[79],"G,":[80],"such":[81],"that":[82],"\u222a":[84],"remains":[86],"after":[88],"failure":[90],"any":[92],"single":[93],"link.":[94]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2017-07-31T00:00:00"}