Low-congestion shortcuts without embedding
From MaRDI portal
Publication:2657278
DOI10.1007/s00446-020-00383-2OpenAlexW3044149877MaRDI QIDQ2657278
Bernhard Haeupler, Taisuke Izumi, Goran Zuzic
Publication date: 12 March 2021
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.07553
Cites Work
- Unnamed Item
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Near-optimal low-congestion shortcuts on bounded parameter graphs
- A fast distributed approximation algorithm for minimum spanning trees
- Distributed distance computation and routing with small messages
- A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
- Near-Optimal Distributed Maximum Flow
- Distributed Minimum Cut Approximation
- Optimal distributed all pairs shortest paths and applications
- An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem
- A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
- Distributed Computing: A Locality-Sensitive Approach
- Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
- Round- and Message-Optimal Distributed Graph Algorithms
- Minor Excluded Network Families Admit Fast Distributed Algorithms
- Distributed approximation algorithms for weighted shortest paths
- Fast distributed construction of k-dominating sets and applications
- Distributed Algorithms for Planar Networks I
- Low-Congestion Shortcuts without Embedding
- Distributed verification and hardness of distributed approximation
- Almost-Tight Distributed Minimum Cut Algorithms
- Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history
This page was built for publication: Low-congestion shortcuts without embedding
