Distributed Minimum Cut Approximation
From MaRDI portal
Publication:2920962
DOI10.1007/978-3-642-41527-2_1zbMath1435.68379arXiv1305.5520OpenAlexW1497938971MaRDI QIDQ2920962
Publication date: 29 September 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1305.5520
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Randomized algorithms (68W20) Distributed algorithms (68W15)
Related Items (12)
Fast Distributed Approximation for Max-Cut ⋮ Low-congestion shortcuts without embedding ⋮ (1- ϵ )-Approximate Maximum Weighted Matching in poly(1/ ϵ , log n ) Time in the Distributed and Parallel Settings ⋮ Distributed Graph Algorithms and their Complexity: An Introduction ⋮ On efficient distributed construction of near optimal routing schemes ⋮ Distributed construction of purely additive spanners ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Message lower bounds via efficient network synchronization ⋮ A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths ⋮ Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time ⋮ A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
This page was built for publication: Distributed Minimum Cut Approximation
