scientific article; zbMATH DE number 6784993
From MaRDI portal
Publication:5363797
DOI10.4230/LIPIcs.OPODIS.2015.6zbMath1380.68428arXiv1412.3445MaRDI QIDQ5363797
Stephan Holzer, Nathan Pinsker
Publication date: 29 September 2017
Full work available at URL: https://arxiv.org/abs/1412.3445
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed systems (68M14) Approximation algorithms (68W25) Distributed algorithms (68W15)
Related Items (11)
Derandomizing local distributed algorithms under bandwidth restrictions ⋮ Distributed distance computation and routing with small messages ⋮ Lessons from the congested clique applied to MapReduce ⋮ Algebraic methods in the congested clique ⋮ Distributed construction of purely additive spanners ⋮ Unnamed Item ⋮ The Impact of Locality in the Broadcast Congested Clique Model ⋮ Fast approximate shortest paths in the congested clique ⋮ A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths ⋮ Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE ⋮ Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time
This page was built for publication:
