2(1 - 1/ℓ)-Factor Steiner Tree Approximation in Õ(n^1/3) Rounds in the CONGESTED CLIQUE
We study the Steiner tree problem in the CONGESTED CLIQUE model of distributed computing. We present a deterministic distributed approximation algorithm that computes a Steiner tree in Õ(n^1/3) rounds and Õ(n^7/3) messages for a given undirected weighted graph of n nodes with the approximation facto...
Uložené v:
| Vydané v: | International Symposium on Computing and Networking (Online) s. 82 - 91 |
|---|---|
| Hlavní autori: | , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.11.2019
|
| Predmet: | |
| ISSN: | 2379-1896 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We study the Steiner tree problem in the CONGESTED CLIQUE model of distributed computing. We present a deterministic distributed approximation algorithm that computes a Steiner tree in Õ(n^1/3) rounds and Õ(n^7/3) messages for a given undirected weighted graph of n nodes with the approximation factor 2(1 - 1/ℓ) of the optimal, where ℓ is the number of terminal leaf nodes in the optimal Steiner tree. Note here that the Õ(⋅) notation hides polylogarithmic factors in n. To the best of our knowledge, this is the first work to study the Steiner tree problem in the CONGESTED CLIQUE model. |
|---|---|
| AbstractList | We study the Steiner tree problem in the CONGESTED CLIQUE model of distributed computing. We present a deterministic distributed approximation algorithm that computes a Steiner tree in Õ(n^1/3) rounds and Õ(n^7/3) messages for a given undirected weighted graph of n nodes with the approximation factor 2(1 - 1/ℓ) of the optimal, where ℓ is the number of terminal leaf nodes in the optimal Steiner tree. Note here that the Õ(⋅) notation hides polylogarithmic factors in n. To the best of our knowledge, this is the first work to study the Steiner tree problem in the CONGESTED CLIQUE model. |
| Author | Karmakar, Sushanta Saikia, Parikshit |
| Author_xml | – sequence: 1 givenname: Parikshit surname: Saikia fullname: Saikia, Parikshit organization: Indian Institute of Technology Guwahati – sequence: 2 givenname: Sushanta surname: Karmakar fullname: Karmakar, Sushanta organization: Indian Institute of Technology Guwahati |
| BookMark | eNotjs1Kw0AURkdRsK19AHEzS7tIO_fOZH6WIU1robTYn40LS8hcMaKTkkTQvW8gPpFv4pNY0dUHh8Ph67KTUAVi7ALEEEC4UZosxslqiALcUAgB9oh1waAFZTCOj1kHpXERWKfPWL9pHg-ORKGElh12i1fAIw6j7_ePQTTJi7aq-bqlMlDNNzURT_b7unotn_O2rAIvA__6vAp3MJIDvqpegm9-WftAPF0uptl6k415Op_dbLNzdnqfPzXU_98e206yTXodzZfTWZrMoxKFbCPyqJQrtJGaTEEo0dtCa-sx1wUKBCmFUlgorXInDXlNlHslPMTaKxPLHrv865ZEtNvXh6v128662Cqj5Q-g5lCx |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/CANDAR.2019.00018 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Forestry Computer Science |
| EISBN | 1728147255 9781728147253 |
| EISSN | 2379-1896 |
| EndPage | 91 |
| ExternalDocumentID | 8958476 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IL 6IN AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK OCL RIE RIL |
| ID | FETCH-LOGICAL-i203t-ed2449c6736e7ce232d8c668d2a6c2021330442c464a937ed6eead40d156d4753 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000532488500009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 07:43:36 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i203t-ed2449c6736e7ce232d8c668d2a6c2021330442c464a937ed6eead40d156d4753 |
| PageCount | 10 |
| ParticipantIDs | ieee_primary_8958476 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-Nov. |
| PublicationDateYYYYMMDD | 2019-11-01 |
| PublicationDate_xml | – month: 11 year: 2019 text: 2019-Nov. |
| PublicationDecade | 2010 |
| PublicationTitle | International Symposium on Computing and Networking (Online) |
| PublicationTitleAbbrev | CANDAR |
| PublicationYear | 2019 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0003204063 |
| Score | 1.7109348 |
| Snippet | We study the Steiner tree problem in the CONGESTED CLIQUE model of distributed computing. We present a deterministic distributed approximation algorithm that... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 82 |
| SubjectTerms | Approximation algorithms Computational modeling CONGESTED CLIQUE distributed approximation algorithm Distributed computing Forestry Knowledge engineering shortest path forest Steiner tree Steiner trees |
| Title | 2(1 - 1/ℓ)-Factor Steiner Tree Approximation in Õ(n^1/3) Rounds in the CONGESTED CLIQUE |
| URI | https://ieeexplore.ieee.org/document/8958476 |
| WOSCitedRecordID | wos000532488500009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LSgMxFA21iLiqthXfZOGiBcdpZjLJzLKMrQql1j6kuLDMJHegm6n0IX6AfyB-kX_il5g7rdWFG3chEAJ53Zt77zmHkLM4iGXkaWl5iYek2iAsX0lmueCpSMogYRkdw31Lttv-cBh0cuR8jYUBgKz4DC6wmeXy9UQtMFRm-wEm9cQG2ZBSLLFa63iK65jjKNxV4pLVAjusty_rXazeQkrKGsp6_BJQyexHs_C_mXdI-QeIRztrE7NLcpAWSeFbiYGuLmaRbKHCJsq2lciDU2HUosz-fH2rWs1MTof2UNPSDOhPAWgdacRfxkvMIh2n9OO9kj4y263SLooszbDP-IU0vG1fNXrmaaNh6-Zu0CiTQbPRD6-tlYCCNXZq7twCbYx3oLB0C6QC4zxpXwnhaycSyjHWHYMZ3FFc8Mi4KaAFmIPFa9p86jQ3H5k9kk8nKewTqlzBWBLHUexznsRepBgkkIgg5rGnlD4gJVy10dOSI2O0WrDDv7uPyDZuyxLTd0zy8-kCTsimep6PZ9PTbGO_ABWOopc |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3LTsJAFIZPEI26QlHj3Vm4gMQK08u0XRIEJWJFRWNcSNqZ04RNMVyMD-AbGJ_IN_FJnFMqunDjrpmkaTKXnjPn8n8Ah5EfuaGjXMOJHRLVRmF40uWGhY4MXdePeSrHcNd2g8C7v_c7OTia9cIgYlp8hsf0mOby1UBOKFRW8XxK6ok5mCdyVtatNYuoWKbekMLKUpe86lfqteCkdk31WyRKWSWwxy-ESmpBmoX_fXsF1n9a8VhnZmRWIYdJEQrfLAaWHc0iLBJjk8Bta_BgljgzGK98vr6VjWYK1GE3RLXUL3SHiKxGQuIv_WnXIusn7OO9lDzyilVm14RZGtGY9gxZ_TI4bdzonxurt1tXt411uG02uvUzI0MoGH2zao0NVNp8-5KKt9CVqN0n5UkhPGWGQpravlM4wzalLexQOyqoBOqtZVeVvtYpW19lNiCfDBLcBCYtwXkcRWHk2XYcOaHkGGMs_MiOHCnVFqzRrPWepioZvWzCtv8ePoCls-5Fu9duBec7sExLNO3w24X8eDjBPViQz-P-aLifLvIXvuil4A |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=International+Symposium+on+Computing+and+Networking+%28Online%29&rft.atitle=2%281+-+1%2F%E2%84%93%29-Factor+Steiner+Tree+Approximation+in+%C3%95%28n%5E1%2F3%29+Rounds+in+the+CONGESTED+CLIQUE&rft.au=Saikia%2C+Parikshit&rft.au=Karmakar%2C+Sushanta&rft.date=2019-11-01&rft.pub=IEEE&rft.eissn=2379-1896&rft.spage=82&rft.epage=91&rft_id=info:doi/10.1109%2FCANDAR.2019.00018&rft.externalDocID=8958476 |