Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion

11/06/2017
by   Timothy Carpenter, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2021

Constant congestion brambles in directed graphs

The Directed Grid Theorem, stating that there is a function f such that ...
research
07/21/2020

Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators

Since 2000 there has been a steady stream of advances for the maximum we...
research
02/04/2022

Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion

In the F-minor-free deletion problem we want to find a minimum vertex se...
research
05/10/2020

Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks

This paper addresses the following fundamental maximum throughput routin...
research
11/04/2017

On constant multi-commodity flow-cut gaps for directed minor-free graphs

The multi-commodity flow-cut gap is a fundamental parameter that affects...
research
09/25/2020

On the Approximability of Robust Network Design

Given the dynamic nature of traffic, we investigate the variant of robus...
research
04/04/2023

VC Set Systems in Minor-free (Di)Graphs and Applications

A recent line of work on VC set systems in minor-free (undirected) graph...

Please sign up or login with your details

Forgot password? Click here to reset