{"id":"https://openalex.org/W2966268726","doi":"https://doi.org/10.1142/s0129054120500367","title":"Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE","display_name":"Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE","publication_year":2020,"publication_date":"2020-11-01","ids":{"openalex":"https://openalex.org/W2966268726","doi":"https://doi.org/10.1142/s0129054120500367","mag":"2966268726"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054120500367","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054120500367","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-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/A5077975268","display_name":"Parikshit Saikia","orcid":"https://orcid.org/0000-0001-6306-9994"},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Parikshit Saikia","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Guwahati, India, 781039, India"],"raw_orcid":"https://orcid.org/0000-0001-6306-9994","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Guwahati, India, 781039, India","institution_ids":["https://openalex.org/I1317621060"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5105141248","display_name":"Sushanta Karmakar","orcid":"https://orcid.org/0000-0003-3528-304X"},"institutions":[{"id":"https://openalex.org/I1317621060","display_name":"Indian Institute of Technology Guwahati","ror":"https://ror.org/0022nd079","country_code":"IN","type":"education","lineage":["https://openalex.org/I1317621060"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sushanta Karmakar","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology, Guwahati, India, 781039, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology, Guwahati, India, 781039, India","institution_ids":["https://openalex.org/I1317621060"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077975268"],"corresponding_institution_ids":["https://openalex.org/I1317621060"],"apc_list":null,"apc_paid":null,"fwci":0.8671,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.78403085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"31","issue":"07","first_page":"941","last_page":"968"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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.9980999827384949,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8666409254074097},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6696667671203613},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6511956453323364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5714281797409058},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.5056171417236328},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5001540184020996},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4539974331855774},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43575823307037354},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4328264594078064},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.42289745807647705},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.41890373826026917},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41252440214157104},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4104553461074829},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3838571310043335},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33577802777290344},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33500826358795166},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2106902003288269},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15149009227752686},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.14414766430854797},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.11047112941741943}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8666409254074097},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6696667671203613},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6511956453323364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5714281797409058},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.5056171417236328},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5001540184020996},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4539974331855774},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43575823307037354},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4328264594078064},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.42289745807647705},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.41890373826026917},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41252440214157104},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4104553461074829},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3838571310043335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33577802777290344},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33500826358795166},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2106902003288269},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15149009227752686},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.14414766430854797},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.11047112941741943},{"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.1142/s0129054120500367","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054120500367","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1568087609","https://openalex.org/W1816797629","https://openalex.org/W1845051857","https://openalex.org/W1863846876","https://openalex.org/W1866858131","https://openalex.org/W1973201650","https://openalex.org/W1975290397","https://openalex.org/W1987099434","https://openalex.org/W1991055327","https://openalex.org/W1992996565","https://openalex.org/W1993553699","https://openalex.org/W2015819397","https://openalex.org/W2027515293","https://openalex.org/W2040011014","https://openalex.org/W2040273581","https://openalex.org/W2045760791","https://openalex.org/W2054910423","https://openalex.org/W2056695987","https://openalex.org/W2058191123","https://openalex.org/W2100812758","https://openalex.org/W2107008873","https://openalex.org/W2107805020","https://openalex.org/W2139535340","https://openalex.org/W2140232587","https://openalex.org/W2173213060","https://openalex.org/W2401610261","https://openalex.org/W2488670996","https://openalex.org/W2761514476","https://openalex.org/W2962883508","https://openalex.org/W2963015907"],"related_works":["https://openalex.org/W2183636263","https://openalex.org/W1595291551","https://openalex.org/W974563791","https://openalex.org/W2739242419","https://openalex.org/W2999680961","https://openalex.org/W1585318792","https://openalex.org/W1524393328","https://openalex.org/W2949165555","https://openalex.org/W2096702260","https://openalex.org/W4244816249"],"abstract_inverted_index":{"The":[0,110,153],"Steiner":[1,34,104,115,158,217,303],"tree":[2,35,105,116,159,304],"problem":[3,21,36,106,305],"is":[4,49,79,208,296],"one":[5,155,234,257],"of":[6,29,45,87,134,185,200,211,237,260,278,285,292],"the":[7,23,33,38,46,61,64,74,81,93,103,108,179,189,194,209,215,225,232,238,242,251,255,261,271,290,297,302,307],"fundamental":[8],"and":[9,55,85,122,165,174,183,282],"classical":[10],"problems":[11],"in":[12,22,37,80,92,107,149,188,214,235,258,306],"combinatorial":[13],"optimization.":[14],"In":[15,264],"this":[16,20,295],"paper":[17],"we":[18,40],"study":[19,301],"CONGESTED":[24],"CLIQUE":[25],"model":[26],"(CCM)":[27],"[29]":[28],"distributed":[30,99],"computing.":[31],"For":[32,219],"CCM,":[39],"consider":[41],"that":[42,141],"each":[43,69],"vertex":[44,75],"input":[47,191],"graph":[48,133],"uniquely":[50],"mapped":[51,59],"to":[52,60,77,300],"a":[53,114,128,157,275],"processor":[54,70],"edges":[56,90,186],"are":[57,91,178],"naturally":[58],"links":[62],"between":[63],"corresponding":[65],"processors.":[66],"Regarding":[67],"output,":[68],"should":[71],"know":[72],"whether":[73],"assigned":[76],"it":[78],"solution":[82],"or":[83],"not":[84],"which":[86],"its":[88],"incident":[89],"solution.":[94],"We":[95],"present":[96],"two":[97],"deterministic":[98],"approximation":[100,198],"algorithms":[101,195],"for":[102,127,245],"CCM.":[109,308],"first":[111,226,256,298],"algorithm":[112,227,253,273],"computes":[113,156],"using":[117,160],"[Formula:":[118,123,135,142,150,161,166,171,175,201,205,222,248,267,279,286],"see":[119,124,136,143,151,162,167,172,176,202,206,223,249,268,280,287],"text]":[120,125,137,144,163,168,173,177,207,269,281],"rounds":[121,164],"messages":[126],"given":[129,190],"connected":[130],"undirected":[131],"weighted":[132],"nodes.":[138],"Note":[139],"here":[140],"notation":[145],"hides":[146],"polylogarithmic":[147],"factors":[148],"text].":[152,288],"second":[154,233,252,272],"messages,":[169],"where":[170,204],"shortest":[180],"path":[181],"diameter":[182],"number":[184,210],"respectively":[187],"graph.":[192],"Both":[193],"achieve":[196],"an":[197],"ratio":[199],"text],":[203,224,250],"leaf":[212],"nodes":[213],"optimal":[216],"tree.":[218],"graphs":[220,246],"with":[221,247],"exhibits":[228],"better":[229],"performance":[230],"than":[231],"terms":[236,259],"round":[239,262,276],"complexity.":[240,263],"On":[241],"other":[243],"hand,":[244],"outperforms":[254],"fact":[265],"when":[266],"then":[270],"achieves":[274],"complexity":[277,284],"message":[283],"To":[289],"best":[291],"our":[293],"knowledge,":[294],"work":[299]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}