Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs
We provide a deterministic CONGEST algorithm to constant factor approximate the minimum dominating set on graphs of bounded arboricity in $O(\log n)$ rounds. This improves over the well-known randomized algorithm of Lenzen and Wattenhofer[DISC2010] by making it a deterministic algorithm.
Saved in:
| Main Author: | |
|---|---|
| Format: | Journal Article |
| Language: | English |
| Published: |
16-02-2021
|
| Subjects: | |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We provide a deterministic CONGEST algorithm to constant factor approximate
the minimum dominating set on graphs of bounded arboricity in $O(\log n)$
rounds. This improves over the well-known randomized algorithm of Lenzen and
Wattenhofer[DISC2010] by making it a deterministic algorithm. |
|---|---|
| AbstractList | We provide a deterministic CONGEST algorithm to constant factor approximate
the minimum dominating set on graphs of bounded arboricity in $O(\log n)$
rounds. This improves over the well-known randomized algorithm of Lenzen and
Wattenhofer[DISC2010] by making it a deterministic algorithm. |
| Author | Amiri, Saeed Akhoondian |
| Author_xml | – sequence: 1 givenname: Saeed Akhoondian surname: Amiri fullname: Amiri, Saeed Akhoondian |
| BackLink | https://doi.org/10.48550/arXiv.2102.08076$$DView paper in arXiv |
| BookMark | eNotz71OwzAYhWEPMEDhApjwDSTYcfzZHkNSUqRCh2aP_FdqqYkrJyB695TCdIYjvdJzi67GOHqEHijJS8k5edLpO3zlBSVFTiQRcIOaxs8-DWEM0xwsrjfv7XLb4erwEVOY9wPexYTfmi2OI36On6PzDlfJnE8b5hNukz7upzt0vdOHyd__7wJ1L8uuXmXrTftaV-tMg4BMGJBOWaMYYwVx3DtagpXWmgJKquCcdp6L0lAO3CrNQFhDQYIwWrpCsQV6_MteGP0xhUGnU__L6S8c9gM_8EXr |
| ContentType | Journal Article |
| Copyright | http://creativecommons.org/licenses/by-nc-nd/4.0 |
| Copyright_xml | – notice: http://creativecommons.org/licenses/by-nc-nd/4.0 |
| DBID | AKY GOX |
| DOI | 10.48550/arxiv.2102.08076 |
| DatabaseName | arXiv Computer Science arXiv.org |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: GOX name: arXiv.org url: http://arxiv.org/find sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 2102_08076 |
| GroupedDBID | AKY GOX |
| ID | FETCH-LOGICAL-a676-7b68d9cb933320d5ed146c8ccb264196dedde574b1565c9a367cb16867ba8d293 |
| IEDL.DBID | GOX |
| IngestDate | Mon Jan 08 05:46:20 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a676-7b68d9cb933320d5ed146c8ccb264196dedde574b1565c9a367cb16867ba8d293 |
| OpenAccessLink | https://arxiv.org/abs/2102.08076 |
| ParticipantIDs | arxiv_primary_2102_08076 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-02-16 |
| PublicationDateYYYYMMDD | 2021-02-16 |
| PublicationDate_xml | – month: 02 year: 2021 text: 2021-02-16 day: 16 |
| PublicationDecade | 2020 |
| PublicationYear | 2021 |
| Score | 1.7985367 |
| SecondaryResourceType | preprint |
| Snippet | We provide a deterministic CONGEST algorithm to constant factor approximate
the minimum dominating set on graphs of bounded arboricity in $O(\log n)$
rounds.... |
| SourceID | arxiv |
| SourceType | Open Access Repository |
| SubjectTerms | Computer Science - Data Structures and Algorithms Computer Science - Distributed, Parallel, and Cluster Computing |
| Title | Deterministic CONGEST Algorithm for MDS on Bounded Arboricity Graphs |
| URI | https://arxiv.org/abs/2102.08076 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdV09T8MwED2RTiwIBKh8ygNroMk1tjOWJm0X2qEdukXx2QUkaFHTIn4-5yQIFlZ_nOSz5XtPPr8DuDNexMxiEvZdygRFuyTUEWEYU4pGKUOl9URxMlfTpc5yL5Mjfv7ClNuv189GH9hUD56P3DOmUTKAII59ytZ4tmweJ2sprnb87zjGmHXTnyAxOoajFt2JQbMdJ3Dg1qeQZW3KSa2JLIaz6TifL8Tg7XnDzPzlXTBuFE_ZXGzW4tFXOXKWLfiSVcQQWYy9pHR1BotRvhhOwrZ4QVhKJUNlpLYpmRQR455NnOUriTSRYQTCp55NWZeovmH-lFBaolRkIqmlMqW2HIPPocP833VBoEskIfZ7DpnOaKtXiDxhpSiilOLoArr1kouPRp-i8N4oam9c_t91BYexT8_wtU3kNXR22727gaCy-9vayd8ZhnkT |
| link.rule.ids | 228,230,782,887 |
| linkProvider | Cornell University |
| 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=article&rft.atitle=Deterministic+CONGEST+Algorithm+for+MDS+on+Bounded+Arboricity+Graphs&rft.au=Amiri%2C+Saeed+Akhoondian&rft.date=2021-02-16&rft_id=info:doi/10.48550%2Farxiv.2102.08076&rft.externalDocID=2102_08076 |