No label defined (Q5091078)

From MaRDI portal

Revision as of 17:36, 29 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 7561435

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7561435

Statements

scholarly article

0 references

10.4230/LIPIcs.OPODIS.2018.7

0 references

Keren Censor-Hillel

0 references

0 references

0 references

publication date

21 July 2022

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

distributed graph algorithms

0 references

congest model

0 references

weighted BFS trees

0 references

additive spanners

0 references

MaRDI profile type

MaRDI publication profile

0 references

Error Amplification for Pairwise Spanner Lower Bounds

0 references

The 4/3 Additive Spanner Exponent Is Tight

0 references

Near-linear lower bounds for distributed distance computations, even in sparse networks

0 references

A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in Õ(n 3/2 ) Rounds

0 references

Additive spanners and (α, β)-spanners

0 references

A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs

0 references

Distributed Spanner Approximation

0 references

Global computation in a poorly connected world

0 references

Distributed construction of purely additive spanners

0 references

The sparsest additive spanner via multiple weighted BFS trees

0 references

Compact routing schemes with improved stretch

0 references

Distributed Verification and Hardness of Distributed Approximation

0 references

Fast deterministic distributed algorithms for sparse spanners

0 references

Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time

0 references

On the locality of distributed sparse spanner construction

0 references

Local Computation of Nearly Additive Spanners

0 references

Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons

0 references

Computing almost shortest paths

0 references

Distributed exact shortest paths in sublinear time

0 references

Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths

0 references

Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models

0 references

A Distributed Algorithm for Minimum-Weight Spanning Trees

0 references

Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set

0 references

Improved distributed algorithms for exact shortest paths

0 references

A deterministic almost-tight distributed algorithm for approximating single-source shortest paths

0 references

Optimal distributed all pairs shortest paths and applications

0 references

New Pairwise Spanners

0 references

Additive Spanners: A Simple Construction

0 references

Distributed distance computation and routing with small messages

0 references

Efficient distributed source detection with limited bandwidth

0 references

Improved Distributed Approximate Matching

0 references

Distributed approximation algorithms for weighted shortest paths

0 references

Vertex fault tolerant additive spanners

0 references

Congested Clique Algorithms for Graph Spanners

0 references

Distributed Computing: A Locality-Sensitive Approach

0 references

0 references

An Optimal Synchronizer for the Hypercube

0 references

A trade-off between space and efficiency for routing tables

0 references

Distributed algorithms for ultrasparse spanners and linear size skeletons

0 references

Additive Spanners in Nearly Quadratic Time

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5091078

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5091078&oldid=36832691"