Matches in SemOpenAlex for { <https://semopenalex.org/work/W3013926211> ?p ?o ?g. }
- W3013926211 abstract "We consider the Backup Placement problem in networks in the $mathcal{CONGEST}$ distributed setting. Given a network graph $G = (V,E)$, the goal of each vertex $v in V$ is selecting a neighbor, such that the maximum number of vertices in $V$ that select the same vertex is minimized. The backup placement problem was introduced by Halldorsson, Kohler, Patt-Shamir, and Rawitz, who obtained an $O(log n/ log log n)$ approximation with randomized polylogarithmic time. Their algorithm remained the state-of-the-art for general graphs, as well as specific graph topologies. In this paper we obtain significantly improved algorithms for various graph topologies. Specifically, we show that $O(1)$-approximation to optimal backup placement can be computed deterministically in $O(1)$ rounds in graphs that model wireless networks, certain social networks, claw-free graphs, and more generally, in any graph with neighborhood independence bounded by a constant. At the other end, we consider sparse graphs, such as trees, forests, planar graphs and graphs of constant arboricity, and obtain a constant approximation to optimal backup placement in $O(log n)$ deterministic rounds. Clearly, our constant-time algorithms for graphs with constant neighborhood independence are asymptotically optimal. Moreover, we show that our algorithms for sparse graphs are not far from optimal as well, by proving several lower bounds. Specifically, optimal backup placement of unoriented trees requires $Omega(log n)$ time, and approximate backup placement with a polylogarithmic approximation factor requires $Omega(sqrt {log n / log log n})$ time. Our results extend the knowledge regarding the question of what can be computed locally?, and reveal surprising gaps between complexities of distributed symmetry breaking problems." @default.
- W3013926211 created "2020-04-03" @default.
- W3013926211 creator A5030616543 @default.
- W3013926211 creator A5057471294 @default.
- W3013926211 date "2019-02-23" @default.
- W3013926211 modified "2023-09-23" @default.
- W3013926211 title "Fast Distributed Backup Placement in Sparse and Dense Networks" @default.
- W3013926211 cites W1578474427 @default.
- W3013926211 cites W1992776880 @default.
- W3013926211 cites W1997707549 @default.
- W3013926211 cites W1998643836 @default.
- W3013926211 cites W1999039705 @default.
- W3013926211 cites W2001475825 @default.
- W3013926211 cites W2006040238 @default.
- W3013926211 cites W2010042187 @default.
- W3013926211 cites W2017345786 @default.
- W3013926211 cites W2022155283 @default.
- W3013926211 cites W2042706982 @default.
- W3013926211 cites W2054910423 @default.
- W3013926211 cites W2077158870 @default.
- W3013926211 cites W2111132249 @default.
- W3013926211 cites W2112398851 @default.
- W3013926211 cites W2157562188 @default.
- W3013926211 cites W2165441947 @default.
- W3013926211 cites W2169324896 @default.
- W3013926211 cites W2247930756 @default.
- W3013926211 cites W2266336423 @default.
- W3013926211 cites W2487418934 @default.
- W3013926211 cites W2542676400 @default.
- W3013926211 cites W2621150082 @default.
- W3013926211 cites W2776370578 @default.
- W3013926211 cites W2885321421 @default.
- W3013926211 cites W2909713209 @default.
- W3013926211 cites W2927492090 @default.
- W3013926211 doi "https://doi.org/10.48550/arxiv.1902.08819" @default.
- W3013926211 hasPublicationYear "2019" @default.
- W3013926211 type Work @default.
- W3013926211 sameAs 3013926211 @default.
- W3013926211 citedByCount "1" @default.
- W3013926211 countsByYear W30139262112020 @default.
- W3013926211 crossrefType "posted-content" @default.
- W3013926211 hasAuthorship W3013926211A5030616543 @default.
- W3013926211 hasAuthorship W3013926211A5057471294 @default.
- W3013926211 hasBestOaLocation W30139262111 @default.
- W3013926211 hasConcept C101837359 @default.
- W3013926211 hasConcept C111919701 @default.
- W3013926211 hasConcept C114614502 @default.
- W3013926211 hasConcept C118615104 @default.
- W3013926211 hasConcept C120314980 @default.
- W3013926211 hasConcept C121332964 @default.
- W3013926211 hasConcept C130120984 @default.
- W3013926211 hasConcept C132525143 @default.
- W3013926211 hasConcept C132569581 @default.
- W3013926211 hasConcept C134306372 @default.
- W3013926211 hasConcept C148764684 @default.
- W3013926211 hasConcept C199360897 @default.
- W3013926211 hasConcept C199845137 @default.
- W3013926211 hasConcept C203776342 @default.
- W3013926211 hasConcept C2777027219 @default.
- W3013926211 hasConcept C2779557605 @default.
- W3013926211 hasConcept C2780945871 @default.
- W3013926211 hasConcept C33923547 @default.
- W3013926211 hasConcept C34388435 @default.
- W3013926211 hasConcept C41008148 @default.
- W3013926211 hasConcept C43517604 @default.
- W3013926211 hasConcept C62520636 @default.
- W3013926211 hasConcept C63553672 @default.
- W3013926211 hasConcept C77088390 @default.
- W3013926211 hasConcept C80899671 @default.
- W3013926211 hasConcept C83204008 @default.
- W3013926211 hasConceptScore W3013926211C101837359 @default.
- W3013926211 hasConceptScore W3013926211C111919701 @default.
- W3013926211 hasConceptScore W3013926211C114614502 @default.
- W3013926211 hasConceptScore W3013926211C118615104 @default.
- W3013926211 hasConceptScore W3013926211C120314980 @default.
- W3013926211 hasConceptScore W3013926211C121332964 @default.
- W3013926211 hasConceptScore W3013926211C130120984 @default.
- W3013926211 hasConceptScore W3013926211C132525143 @default.
- W3013926211 hasConceptScore W3013926211C132569581 @default.
- W3013926211 hasConceptScore W3013926211C134306372 @default.
- W3013926211 hasConceptScore W3013926211C148764684 @default.
- W3013926211 hasConceptScore W3013926211C199360897 @default.
- W3013926211 hasConceptScore W3013926211C199845137 @default.
- W3013926211 hasConceptScore W3013926211C203776342 @default.
- W3013926211 hasConceptScore W3013926211C2777027219 @default.
- W3013926211 hasConceptScore W3013926211C2779557605 @default.
- W3013926211 hasConceptScore W3013926211C2780945871 @default.
- W3013926211 hasConceptScore W3013926211C33923547 @default.
- W3013926211 hasConceptScore W3013926211C34388435 @default.
- W3013926211 hasConceptScore W3013926211C41008148 @default.
- W3013926211 hasConceptScore W3013926211C43517604 @default.
- W3013926211 hasConceptScore W3013926211C62520636 @default.
- W3013926211 hasConceptScore W3013926211C63553672 @default.
- W3013926211 hasConceptScore W3013926211C77088390 @default.
- W3013926211 hasConceptScore W3013926211C80899671 @default.
- W3013926211 hasConceptScore W3013926211C83204008 @default.
- W3013926211 hasLocation W30139262111 @default.
- W3013926211 hasOpenAccess W3013926211 @default.
- W3013926211 hasPrimaryLocation W30139262111 @default.
- W3013926211 hasRelatedWork W1523755288 @default.