{"id":"https://openalex.org/W2803918337","doi":"https://doi.org/10.1145/3212734.3212760","title":"Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs","display_name":"Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs","publication_year":2018,"publication_date":"2018-07-23","ids":{"openalex":"https://openalex.org/W2803918337","doi":"https://doi.org/10.1145/3212734.3212760","mag":"2803918337"},"language":"en","primary_location":{"id":"doi:10.1145/3212734.3212760","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3212734.3212760","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 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/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":true,"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":1,"corresponding_author_ids":["https://openalex.org/A5052412504"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":1.6155,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.85299968,"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":"149","last_page":"158"},"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.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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.8765928745269775},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8423247337341309},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.7941106557846069},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.7370908856391907},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.6107019782066345},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5859315395355225},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5587283968925476},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4888543486595154},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48450157046318054},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4838079810142517},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.47776901721954346},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.47123393416404724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42060261964797974},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41854628920555115},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4159204363822937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3883917033672333},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2670602798461914},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14784857630729675},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07683077454566956},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.0712636411190033}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.8765928745269775},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8423247337341309},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.7941106557846069},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.7370908856391907},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.6107019782066345},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5859315395355225},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5587283968925476},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4888543486595154},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48450157046318054},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4838079810142517},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.47776901721954346},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.47123393416404724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42060261964797974},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41854628920555115},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4159204363822937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3883917033672333},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2670602798461914},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14784857630729675},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07683077454566956},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0712636411190033},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3212734.3212760","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3212734.3212760","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1465058481","https://openalex.org/W1508113861","https://openalex.org/W1534484868","https://openalex.org/W1568961751","https://openalex.org/W1596370873","https://openalex.org/W1957963525","https://openalex.org/W1969675191","https://openalex.org/W1971680255","https://openalex.org/W1974912205","https://openalex.org/W1984090926","https://openalex.org/W1986478184","https://openalex.org/W1988837529","https://openalex.org/W1989224473","https://openalex.org/W2007004331","https://openalex.org/W2015819397","https://openalex.org/W2040924621","https://openalex.org/W2077371116","https://openalex.org/W2083162966","https://openalex.org/W2083323175","https://openalex.org/W2090222354","https://openalex.org/W2092113566","https://openalex.org/W2134875769","https://openalex.org/W2153507546","https://openalex.org/W2157054705","https://openalex.org/W2163097371","https://openalex.org/W2163322487","https://openalex.org/W2172955861","https://openalex.org/W2467525240","https://openalex.org/W2592535728","https://openalex.org/W2767681636","https://openalex.org/W2786266143","https://openalex.org/W2803918337","https://openalex.org/W2950667052","https://openalex.org/W2951036599","https://openalex.org/W2963420932","https://openalex.org/W2963738383","https://openalex.org/W3015191696"],"related_works":["https://openalex.org/W1569529368","https://openalex.org/W4380840098","https://openalex.org/W3215909732","https://openalex.org/W620960161","https://openalex.org/W2014991506","https://openalex.org/W2099915933","https://openalex.org/W2387385213","https://openalex.org/W2803918337","https://openalex.org/W3016811403","https://openalex.org/W2963355678"],"abstract_inverted_index":{"In":[0],"the":[1,8,13,37,44,52,63],"minimum":[2,14,38],"k-edge-connected":[3],"spanning":[4,39],"subgraph":[5,16],"(k-ECSS)":[6],"problem":[7,28,46],"goal":[9],"is":[10,25,60],"to":[11,18,20],"find":[12],"weight":[15],"resistant":[17],"up":[19],"k-1":[21],"edge":[22],"failures.":[23],"This":[24],"a":[26,33],"central":[27],"in":[29,62],"network":[30],"design,":[31],"and":[32],"natural":[34],"generalization":[35],"of":[36],"tree":[40],"(MST)":[41],"problem.":[42],"While":[43],"MST":[45],"has":[47],"been":[48],"studied":[49],"extensively":[50],"by":[51],"distributed":[53,64],"computing":[54],"community,":[55],"for":[56],"k":[57],"\u22652":[58],"less":[59],"known":[61],"setting.":[65]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}