279 research outputs found
A Polylogarithimic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
In the Edge-Disjoint Paths with Congestion problem (EDPwC), we are given an
undirected n-vertex graph G, a collection M={(s_1,t_1),...,(s_k,t_k)} of demand
pairs and an integer c. The goal is to connect the maximum possible number of
the demand pairs by paths, so that the maximum edge congestion - the number of
paths sharing any edge - is bounded by c. When the maximum allowed congestion
is c=1, this is the classical Edge-Disjoint Paths problem (EDP).
The best current approximation algorithm for EDP achieves an -approximation, by rounding the standard multi-commodity flow relaxation of
the problem. This matches the lower bound on the integrality
gap of this relaxation. We show an -approximation algorithm for
EDPwC with congestion c=2, by rounding the same multi-commodity flow
relaxation. This gives the best possible congestion for a sub-polynomial
approximation of EDPwC via this relaxation. Our results are also close to
optimal in terms of the number of pairs routed, since EDPwC is known to be hard
to approximate to within a factor of for
any constant congestion c. Prior to our work, the best approximation factor for
EDPwC with congestion 2 was , and the best algorithm
achieving a polylogarithmic approximation required congestion 14
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion
The problem of routing in graphs using node-disjoint paths has received a lot of attention and a polylogarithmic approximation algorithm with constant congestion is known for undirected graphs [Chuzhoy and Li 2016] and [Chekuri and Ene 2013]. However, the problem is hard to approximate within polynomial factors on directed graphs, for any constant congestion [Chuzhoy, Kim and Li 2016].
Recently, [Chekuri, Ene and Pilipczuk 2016] have obtained a polylogarithmic approximation with constant congestion on directed planar graphs, for the special case of symmetric demands. We extend their result by obtaining a polylogarithmic approximation with constant congestion on arbitrary directed minor-free graphs, for the case of symmetric demands
Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems
Dynamic Flows were introduced by Ford and Fulkerson in 1958 to model flows over time. They define edge capacities to be the total amount of flow that can enter an edge in one time unit. Each edge also has a length, representing the time needed to traverse it. Dynamic Flows have been used to model many problems including traffic congestion, hop-routing of packets and evacuation protocols in buildings. While the basic problem of moving the maximal amount of supplies from sources to sinks is polynomial time solvable, natural minor modifications can make it NP-hard.
One such modification is that flows be confluent, i.e., all flows leaving a vertex must leave along the same edge. This corresponds to natural conditions in, e.g., evacuation planning and hop routing.
We investigate the single-sink Confluent Quickest Flow problem. The input is a graph with edge capacities and lengths, sources with supplies and a sink. The problem is to find a confluent flow minimizing the time required to send supplies to the sink. Our main results include:
a) Logarithmic Non-Approximability: Directed Confluent Quickest Flows cannot be approximated in polynomial time with an O(log n) approximation factor, unless P=NP.
b) Polylogarithmic Bicriteria Approximations: Polynomial time (O(log^8 n), O(log^2 kappa)) bicritera approximation algorithms for the Confluent Quickest Flow problem where kappa is the number of sinks, in both directed and undirected graphs.
Corresponding results are also developed for the Confluent Maximum Flow over time problem. The techniques developed also improve recent approximation algorithms for static confluent flows
Low-Congestion Shortcut and Graph Parameters
Distributed graph algorithms in the standard CONGEST model often exhibit the time-complexity lower bound of Omega~(sqrt{n} + D) rounds for many global problems, where n is the number of nodes and D is the diameter of the input graph. Since such a lower bound is derived from special "hard-core" instances, it does not necessarily apply to specific popular graph classes such as planar graphs. The concept of low-congestion shortcuts is initiated by Ghaffari and Haeupler [SODA2016] for addressing the design of CONGEST algorithms running fast in restricted network topologies. Specifically, given a specific graph class X, an f-round algorithm of constructing shortcuts of quality q for any instance in X results in O~(q + f)-round algorithms of solving several fundamental graph problems such as minimum spanning tree and minimum cut, for X. The main interest on this line is to identify the graph classes allowing the shortcuts which are efficient in the sense of breaking O~(sqrt{n}+D)-round general lower bounds.
In this paper, we consider the relationship between the quality of low-congestion shortcuts and three major graph parameters, chordality, diameter, and clique-width. The main contribution of the paper is threefold: (1) We show an O(1)-round algorithm which constructs a low-congestion shortcut with quality O(kD) for any k-chordal graph, and prove that the quality and running time of this construction is nearly optimal up to polylogarithmic factors. (2) We present two algorithms, each of which constructs a low-congestion shortcut with quality O~(n^{1/4}) in O~(n^{1/4}) rounds for graphs of D=3, and that with quality O~(n^{1/3}) in O~(n^{1/3}) rounds for graphs of D=4 respectively. These results obviously deduce two MST algorithms running in O~(n^{1/4}) and O~(n^{1/3}) rounds for D=3 and 4 respectively, which almost close the long-standing complexity gap of the MST construction in small-diameter graphs originally posed by Lotker et al. [Distributed Computing 2006]. (3) We show that bounding clique-width does not help the construction of good shortcuts by presenting a network topology of clique-width six where the construction of MST is as expensive as the general case
Undirected -Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms
This paper presents near-optimal deterministic parallel and distributed
algorithms for computing -approximate single-source shortest
paths in any undirected weighted graph.
On a high level, we deterministically reduce this and other shortest-path
problems to Minor-Aggregations. A Minor-Aggregation computes an
aggregate (e.g., max or sum) of node-values for every connected component of
some subgraph.
Our reduction immediately implies:
Optimal deterministic parallel (PRAM) algorithms with depth
and near-linear work.
Universally-optimal deterministic distributed (CONGEST) algorithms, whenever
deterministic Minor-Aggregate algorithms exist. For example, an optimal
-round deterministic CONGEST algorithm for
excluded-minor networks.
Several novel tools developed for the above results are interesting in their
own right:
A local iterative approach for reducing shortest path computations "up to
distance " to computing low-diameter decompositions "up to distance
". Compared to the recursive vertex-reduction approach of [Li20],
our approach is simpler, suitable for distributed algorithms, and eliminates
many derandomization barriers.
A simple graph-based -competitive -oblivious routing
based on low-diameter decompositions that can be evaluated in near-linear work.
The previous such routing [ZGY+20] was -competitive and required
more work.
A deterministic algorithm to round any fractional single-source transshipment
flow into an integral tree solution.
The first distributed algorithms for computing Eulerian orientations
Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators
Since 1997 there has been a steady stream of advances for the maximum
disjoint paths problem. Achieving tractable results has usually required
focusing on relaxations such as: (i) to allow some bounded edge congestion in
solutions, (ii) to only consider the unit weight (cardinality) setting, (iii)
to only require fractional routability of the selected demands (the
all-or-nothing flow setting). For the general form (no congestion, general
weights, integral routing) of edge-disjoint paths ({\sc edp}) even the case of
unit capacity trees which are stars generalizes the maximum matching problem
for which Edmonds provided an exact algorithm. For general capacitated trees,
Garg, Vazirani, Yannakakis showed the problem is APX-Hard and Chekuri, Mydlarz,
Shepherd provided a -approximation. This is essentially the only setting
where a constant approximation is known for the general form of \textsc{edp}.
We extend their result by giving a constant-factor approximation algorithm for
general-form \textsc{edp} in outerplanar graphs. A key component for the
algorithm is to find a {\em single-tree} cut approximator for
outerplanar graphs. Previously cut approximators were only known via
distributions on trees and these were based implicitly on the results of Gupta,
Newman, Rabinovich and Sinclair for distance tree embeddings combined with
results of Anderson and Feige.Comment: 19 pages, 6 figure
- …