Papers
Topics
Authors
Recent
Search
2000 character limit reached

Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic and Fast

Published 2 Nov 2021 in cs.DS | (2111.01422v5)

Abstract: Computing routing schemes that support both high throughput and low latency is one of the core challenges of network optimization. Such routes can be formalized as hh-length flows which are defined as flows whose flow paths are restricted to have length at most hh. Many well-studied algorithmic primitives -- such as maximal and maximum length-constrained disjoint paths -- are special cases of hh-length flows. Likewise the optimal hh-length flow is a fundamental quantity in network optimization, characterizing, up to poly-log factors, how quickly a network can accomplish numerous distributed primitives. In this work, we give the first efficient algorithms for computing (1−ϵ)(1 - \epsilon)-approximate hh-length flows. We give deterministic algorithms that take O~(poly(h,1ϵ))\tilde{O}(\text{poly}(h, \frac{1}{\epsilon})) parallel time and O~(poly(h,1ϵ)⋅2O(log⁡n))\tilde{O}(\text{poly}(h, \frac{1}{\epsilon}) \cdot 2^{O(\sqrt{\log n})}) distributed CONGEST time. We also give a CONGEST algorithm that succeeds with high probability and only takes O~(poly(h,1ϵ))\tilde{O}(\text{poly}(h, \frac{1}{\epsilon})) time. Using our hh-length flow algorithms, we give the first efficient deterministic CONGEST algorithms for the maximal length-constrained disjoint paths problem -- settling an open question of Chang and Saranurak (FOCS 2020) -- as well as essentially-optimal parallel and distributed approximation algorithms for maximum length-constrained disjoint paths. The former greatly simplifies deterministic CONGEST algorithms for computing expander decompositions. We also use our techniques to give the first efficient (1−ϵ)(1-\epsilon)-approximation algorithms for bipartite bb-matching in CONGEST. Lastly, using our flow algorithms, we give the first algorithms to efficiently compute hh-length cutmatches, an object at the heart of recent advances in length-constrained expander decompositions.

Citations (7)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.