scientific article; zbMATH DE number 7561285
From MaRDI portal
Publication:5090925
DOI10.4230/LIPIcs.DISC.2018.33zbMath1502.68363arXiv1802.03671MaRDI QIDQ5090925
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1802.03671
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15)
Related Items (4)
Time-optimal construction of overlay networks ⋮ A distributed algorithm for directed minimum-weight spanning tree ⋮ Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications ⋮ Low-congestion shortcut and graph parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
- Near-optimal low-congestion shortcuts on bounded parameter graphs
- Fast Partial Distance Estimation and Applications
- A Graph-Theoretic Game and Its Application to the k-Server Problem
- Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
- Distributed Verification and Hardness of Distributed Approximation
- Low-diameter graph decomposition is in NC
- Cops, robbers, and threatening skeletons
- Distributed approximation algorithms for weighted shortest paths
- Fast distributed construction of k-dominating sets and applications
- A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
- Distributed Strong Diameter Network Decomposition
- Low-Congestion Shortcuts without Embedding
- Almost-Tight Distributed Minimum Cut Algorithms
This page was built for publication:
