Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Distributed backup placement in networks
Improved deterministic distributed matching via rounding
On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Near-Optimal Distributed Maximum Flow
Graph expansion and the unique games conjecture
Stateless distributed algorithms for near optimal maximum multicommodity flows
Improved Distributed Approximate Matching
Subexponential Algorithms for Unique Games and Related Problems
Length-bounded cuts and flows
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
A Simple Parallel Algorithm for the Maximal Independent Set Problem
Existence and Construction of Edge-Disjoint Paths on Expander Graphs
Distributed Computing: A Locality-Sensitive Approach
Deterministic Edge Connectivity in Near-Linear Time
Approximate Max-Flow on Small Depth Networks
Distributed Verification and Hardness of Distributed Approximation
Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n^{1/2 - ε})-time
Lower Bounds for Maximal Matchings and Maximal Independent Sets
Distributed Approximate Maximum Matching in the CONGEST Model.
Parallel approximate undirected shortest paths via low hop emulators
Expander Decomposition and Pruning: Faster, Stronger, and Simpler
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
Distributed network monitoring and multicommodity flows
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants
Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
Universally-optimal distributed algorithms for known topologies
Tree embeddings for hop-constrained network design

This page was built for publication: Maximum length-constrained flows and disjoint paths: distributed, deterministic, and fast