Fast Deterministic Algorithms for Highly-Dynamic Networks
This paper provides an algorithmic framework for obtaining fast distributed algorithms for a highly-dynamic setting, in which *arbitrarily many* edge changes may occur in each round. Our algorithm significantly improves upon prior work in its combination of (1) having an $O(1)$ amortized time comple...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Censor-Hillel, Keren Dafni, Neta Kolobov, Victor I Paz, Ami Schwartzman, Gregory |
| description | This paper provides an algorithmic framework for obtaining fast distributed
algorithms for a highly-dynamic setting, in which *arbitrarily many* edge
changes may occur in each round. Our algorithm significantly improves upon
prior work in its combination of (1) having an $O(1)$ amortized time
complexity, (2) using only $O(\log{n})$-bit messages, (3) not posing any
restrictions on the dynamic behavior of the environment, (4) being
deterministic, (5) having strong guarantees for intermediate solutions, and (6)
being applicable for a wide family of tasks.
The tasks for which we deduce such an algorithm are maximal matching,
$(degree+1)$-coloring, 2-approximation for minimum weight vertex cover, and
maximal independent set (which is the most subtle case). For some of these
tasks, node insertions can also be among the allowed topology changes, and for
some of them also abrupt node deletions. |
| doi_str_mv | 10.48550/arxiv.1901.04008 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1901_04008</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1901_04008</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-1955a39664f0d96801d69056dfdad53566b8afd0a9373f7fb8abbcf6075f234c3</originalsourceid><addsrcrecordid>eNotj8FOwzAQRH3hgEo_gBP5gaRrHG_sY9VSilTBpfdoE2dbi6SpbIuSv6cUTqPRSE_zhHiUUJRGa1hQ-PZfhbQgCygBzL2wG4opW3epC4M_-Zh8my37wxh8Og4x4zFkW3849lO-nk40XNf3Ll3G8BkfxB1TH7v5f87EfvOyX23z3cfr22q5ywkrk0urNSmLWDI4iwakQwsaHTtyWmnExhA7IKsqxRVfW9O0jFBpflZlq2bi6Q97-16fgx8oTPWvQ31zUD_p1EFf</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Fast Deterministic Algorithms for Highly-Dynamic Networks</title><source>arXiv.org</source><creator>Censor-Hillel, Keren ; Dafni, Neta ; Kolobov, Victor I ; Paz, Ami ; Schwartzman, Gregory</creator><creatorcontrib>Censor-Hillel, Keren ; Dafni, Neta ; Kolobov, Victor I ; Paz, Ami ; Schwartzman, Gregory</creatorcontrib><description>This paper provides an algorithmic framework for obtaining fast distributed
algorithms for a highly-dynamic setting, in which *arbitrarily many* edge
changes may occur in each round. Our algorithm significantly improves upon
prior work in its combination of (1) having an $O(1)$ amortized time
complexity, (2) using only $O(\log{n})$-bit messages, (3) not posing any
restrictions on the dynamic behavior of the environment, (4) being
deterministic, (5) having strong guarantees for intermediate solutions, and (6)
being applicable for a wide family of tasks.
The tasks for which we deduce such an algorithm are maximal matching,
$(degree+1)$-coloring, 2-approximation for minimum weight vertex cover, and
maximal independent set (which is the most subtle case). For some of these
tasks, node insertions can also be among the allowed topology changes, and for
some of them also abrupt node deletions.</description><identifier>DOI: 10.48550/arxiv.1901.04008</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms ; Computer Science - Distributed, Parallel, and Cluster Computing</subject><creationdate>2019-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,777,882</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1901.04008$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1901.04008$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Censor-Hillel, Keren</creatorcontrib><creatorcontrib>Dafni, Neta</creatorcontrib><creatorcontrib>Kolobov, Victor I</creatorcontrib><creatorcontrib>Paz, Ami</creatorcontrib><creatorcontrib>Schwartzman, Gregory</creatorcontrib><title>Fast Deterministic Algorithms for Highly-Dynamic Networks</title><description>This paper provides an algorithmic framework for obtaining fast distributed
algorithms for a highly-dynamic setting, in which *arbitrarily many* edge
changes may occur in each round. Our algorithm significantly improves upon
prior work in its combination of (1) having an $O(1)$ amortized time
complexity, (2) using only $O(\log{n})$-bit messages, (3) not posing any
restrictions on the dynamic behavior of the environment, (4) being
deterministic, (5) having strong guarantees for intermediate solutions, and (6)
being applicable for a wide family of tasks.
The tasks for which we deduce such an algorithm are maximal matching,
$(degree+1)$-coloring, 2-approximation for minimum weight vertex cover, and
maximal independent set (which is the most subtle case). For some of these
tasks, node insertions can also be among the allowed topology changes, and for
some of them also abrupt node deletions.</description><subject>Computer Science - Data Structures and Algorithms</subject><subject>Computer Science - Distributed, Parallel, and Cluster Computing</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8FOwzAQRH3hgEo_gBP5gaRrHG_sY9VSilTBpfdoE2dbi6SpbIuSv6cUTqPRSE_zhHiUUJRGa1hQ-PZfhbQgCygBzL2wG4opW3epC4M_-Zh8my37wxh8Og4x4zFkW3849lO-nk40XNf3Ll3G8BkfxB1TH7v5f87EfvOyX23z3cfr22q5ywkrk0urNSmLWDI4iwakQwsaHTtyWmnExhA7IKsqxRVfW9O0jFBpflZlq2bi6Q97-16fgx8oTPWvQ31zUD_p1EFf</recordid><startdate>20190113</startdate><enddate>20190113</enddate><creator>Censor-Hillel, Keren</creator><creator>Dafni, Neta</creator><creator>Kolobov, Victor I</creator><creator>Paz, Ami</creator><creator>Schwartzman, Gregory</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20190113</creationdate><title>Fast Deterministic Algorithms for Highly-Dynamic Networks</title><author>Censor-Hillel, Keren ; Dafni, Neta ; Kolobov, Victor I ; Paz, Ami ; Schwartzman, Gregory</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-1955a39664f0d96801d69056dfdad53566b8afd0a9373f7fb8abbcf6075f234c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><topic>Computer Science - Distributed, Parallel, and Cluster Computing</topic><toplevel>online_resources</toplevel><creatorcontrib>Censor-Hillel, Keren</creatorcontrib><creatorcontrib>Dafni, Neta</creatorcontrib><creatorcontrib>Kolobov, Victor I</creatorcontrib><creatorcontrib>Paz, Ami</creatorcontrib><creatorcontrib>Schwartzman, Gregory</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Censor-Hillel, Keren</au><au>Dafni, Neta</au><au>Kolobov, Victor I</au><au>Paz, Ami</au><au>Schwartzman, Gregory</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fast Deterministic Algorithms for Highly-Dynamic Networks</atitle><date>2019-01-13</date><risdate>2019</risdate><abstract>This paper provides an algorithmic framework for obtaining fast distributed
algorithms for a highly-dynamic setting, in which *arbitrarily many* edge
changes may occur in each round. Our algorithm significantly improves upon
prior work in its combination of (1) having an $O(1)$ amortized time
complexity, (2) using only $O(\log{n})$-bit messages, (3) not posing any
restrictions on the dynamic behavior of the environment, (4) being
deterministic, (5) having strong guarantees for intermediate solutions, and (6)
being applicable for a wide family of tasks.
The tasks for which we deduce such an algorithm are maximal matching,
$(degree+1)$-coloring, 2-approximation for minimum weight vertex cover, and
maximal independent set (which is the most subtle case). For some of these
tasks, node insertions can also be among the allowed topology changes, and for
some of them also abrupt node deletions.</abstract><doi>10.48550/arxiv.1901.04008</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1901.04008 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1901_04008 |
| source | arXiv.org |
| subjects | Computer Science - Data Structures and Algorithms Computer Science - Distributed, Parallel, and Cluster Computing |
| title | Fast Deterministic Algorithms for Highly-Dynamic Networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T02%3A56%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fast%20Deterministic%20Algorithms%20for%20Highly-Dynamic%20Networks&rft.au=Censor-Hillel,%20Keren&rft.date=2019-01-13&rft_id=info:doi/10.48550/arxiv.1901.04008&rft_dat=%3Carxiv_GOX%3E1901_04008%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |