Routing and Treewidth (Recent Developments) Chandra Chekuri Univ. of Illinois, Urbana-Champaign.

Slides:



Advertisements
Similar presentations
Approximate Max-integral-flow/min-cut Theorems Kenji Obata UC Berkeley June 15, 2004.
Advertisements

Routing in Undirected Graphs with Constant Congestion Julia Chuzhoy Toyota Technological Institute at Chicago.
Buy at Bulk Network Design (with Protection) Chandra Chekuri Univ. of Illinois, Urbana-Champaign.
Vertex sparsifiers: New results from old techniques (and some open questions) Robert Krauthgamer (Weizmann Institute) Joint work with Matthias Englert,
Poly-Logarithmic Approximation for EDP with Congestion 2
Primal-Dual Algorithms for Connected Facility Location Chaitanya SwamyAmit Kumar Cornell University.
Approximation Algorithms for Capacitated Set Cover Ravishankar Krishnaswamy (joint work with Nikhil Bansal and Barna Saha)
Approximating Maximum Subgraphs Without Short Cycles Guy Kortsarz Join work with Michael Langberg and Zeev Nutov.
Degree-3 Treewidth Sparsifiers Chandra Chekuri Julia Chuzhoy Univ. of IllinoisTTI Chicago.
Multicut Lower Bounds via Network Coding Anna Blasiak Cornell University.
All-or-Nothing Multicommodity Flow Chandra Chekuri Sanjeev Khanna Bruce Shepherd Bell Labs U. Penn Bell Labs.
Geometric embeddings and graph expansion James R. Lee Institute for Advanced Study (Princeton) University of Washington (Seattle)
Dependent Randomized Rounding in Matroid Polytopes (& Related Results) Chandra Chekuri Jan VondrakRico Zenklusen Univ. of Illinois IBM ResearchMIT.
Approximation Some Network Design Problems With Node Costs Guy Kortsarz Rutgers University, Camden, NJ Joint work with Zeev Nutov The Open University,
The number of edge-disjoint transitive triples in a tournament.
All Rights Reserved © Alcatel-Lucent 2006, ##### Matthew Andrews, Alcatel-Lucent Bell Labs Princeton Approximation Workshop June 15, 2011 Edge-Disjoint.
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design Problems Mohammad R. Salavatipour Department of Computing Science University of Alberta.
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design Problems Guy Kortsarz Rutgers University, Camden, NJ Joint work with C. Chekuri (Bell.
Large-Treewidth Graph Decompositions and Applications
Sparsest Cut S S  G) = min |E(S, S)| |S| S µ V G = (V, E) c- balanced separator  G) = min |E(S, S)| |S| S µ V c |S| ¸ c ¢ |V| Both NP-hard.
1 Approximation Algorithms for Demand- Robust and Stochastic Min-Cut Problems Vineet Goyal Carnegie Mellon University Based on, [Golovin, G, Ravi] (STACS’06)
A Constant Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar Anupam Gupta Tim Roughgarden Bell Labs CMU Cornell joint.
Approximation Algorithm: Iterative Rounding Lecture 15: March 9.
On the Capacity of Information Networks Nick Harvey Collaborators: Micah Adler (UMass), Kamal Jain (Microsoft), Bobby Kleinberg (MIT/Berkeley/Cornell),
Network Design Adam Meyerson Carnegie-Mellon University.
Network Flow Spanners F. F. Dragan and Chenyu Yan Kent State University, Kent, OH, USA.
An Approximation Algorithm for Requirement cut on graphs Viswanath Nagarajan Joint work with R. Ravi.
Augmenting Paths, Witnesses and Improved Approximations for Bounded Degree MSTs K. Chaudhuri, S. Rao, S. Riesenfeld, K. Talwar UC Berkeley.
Collective Additive Tree Spanners of Homogeneously Orderable Graphs
Collective Tree Spanners of Graphs with Bounded Parameters F.F. Dragan and C. Yan Kent State University, USA.
Primal-Dual Algorithms for Connected Facility Location Chaitanya SwamyAmit Kumar Cornell University.
Collective Tree Spanners and Routing in AT-free Related Graphs F.F. Dragan, C. Yan, D. Corneil Kent State University University of Toronto.
1 Introduction to Approximation Algorithms Lecture 15: Mar 5.
Packing Element-Disjoint Steiner Trees Mohammad R. Salavatipour Department of Computing Science University of Alberta Joint with Joseph Cheriyan Department.
Approximation Algorithms for Graph Routing Problems Julia Chuzhoy Toyota Technological Institute at Chicago.
All Rights Reserved © Alcatel-Lucent 2006, ##### Matthew Andrews Show-and-Tell April 20, 2010 Edge Disjoint Paths via Räcke Decompositions.
Kernel Bounds for Structural Parameterizations of Pathwidth Bart M. P. Jansen Joint work with Hans L. Bodlaender & Stefan Kratsch July 6th 2012, SWAT 2012,
APPROXIMATION ALGORITHMS VERTEX COVER – MAX CUT PROBLEMS
Approximating Minimum Bounded Degree Spanning Tree (MBDST) Mohit Singh and Lap Chi Lau “Approximating Minimum Bounded DegreeApproximating Minimum Bounded.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
Approximation and Hardness Results for Packing Cycles Mohammad R. Salavatipour Department of Computing Science University of Alberta Joint work with M.
CSE 421 Algorithms Richard Anderson Lecture 24 Network Flow Applications.
Treewidth, Applications, and some Recent Developments
Primal-Dual Algorithms for Connected Facility Location Chaitanya SwamyAmit Kumar Cornell University.
T HE INTERESTING BEHAVIOR OF THE SOURCE LOCATION PROBLEM G. Kortsarz, Rutgers Camden.
1 On Completing Latin Squares Iman Hajirasouliha Joint work with Hossein Jowhari, Ravi Kumar, and Ravi Sundaram.
Testing the independence number of hypergraphs
Embeddings, flow, and cuts: an introduction University of Washington James R. Lee.
Multicommodity flow, well-linked terminals and routing problems Chandra Chekuri Lucent Bell Labs Joint work with Sanjeev Khanna and Bruce Shepherd Mostly.
Orienteering and related problems: mini-survey and open problems Chandra Chekuri University of Illinois (UIUC)
New algorithms for Disjoint Paths and Routing Problems
Julia Chuzhoy (TTI-C) Yury Makarychev (TTI-C) Aravindan Vijayaraghavan (Princeton) Yuan Zhou (CMU)
Multi-commodity Flows and Cuts in Polymatroidal Networks
Improved Approximation Algorithms for Directed Steiner Forest Moran Feldman Technion Joint work with: Guy Kortsarz,Rutgers University Camden Zeev Nutov,The.
Impact of Network Coding on Combinatorial Optimization Chandra Chekuri Univ. of Illinois, Urbana-Champaign DIMACS Workshop on Network Coding: Next 15 Years.
Kernel Bounds for Path and Cycle Problems Bart M. P. Jansen Joint work with Hans L. Bodlaender & Stefan Kratsch September 8 th 2011, Saarbrucken.
Multiroute Flows & Node-weighted Network Design Chandra Chekuri Univ of Illinois, Urbana-Champaign Joint work with Alina Ene and Ali Vakilian.
New Algorithms for Disjoint Paths Problems Sanjeev Khanna University of Pennsylvania Joint work with Chandra Chekuri Bruce Shepherd.
Polynomial Bounds for the Grid-Minor Theorem Julia Chuzhoy Toyota Technological Institute at Chicago Chandra Chekuri University of Illinois at Urbana-Champaign.
Approximating graph coloring of minor-closed graphs Joint Work with Erik Demaine, Mohammad Hajiaghayi, Bojan Mohar, Robin Thomas Partially joint Work with.
Some Graph Minor Theory and its Uses in Algorithms
Generalized Sparsest Cut and Embeddings of Negative-Type Metrics
A Polynomial-time Tree Decomposition for Minimizing Congestion
Algorithms for Routing Node-Disjoint Paths in Grids
Approximating k-route cuts
A note on the Survivable Network Design Problem
Multipath Routing for Congestion Minimization & Multiroute Flows
Bart Jansen Polynomial Kernels for Hard Problems on Disk Graphs
On the effect of randomness on planted 3-coloring models
Integer multicommodity flow in series-parallel graphs
Presentation transcript:

Routing and Treewidth (Recent Developments) Chandra Chekuri Univ. of Illinois, Urbana-Champaign

Routing Problems Undir graph G=(V,E) and k node-pairs s 1 t 1, s 2 t 2,..., s k t k EDP: can all pairs be connected by edge-disjoint paths? NDP: can pairs be connected by node-disjoint paths? ANF: is there a multiflow for pairs s.t each pair has flow of one unit?

Hardness of Decision Versions NDP/EDP NP-Complete if k is part of input [Karp, Even-Itai-Shamir] EDP/NDP in P if k is fixed [Robertson-Seymour’90] ANF is in P via LP

Maximum Throughput Problems Undir graph G=(V,E) and k node-pairs s 1 t 1, s 2 t 2,..., s k t k MEDP: max # of pairs connected by edge-disj paths MNDP: max # of pairs connected by node-disj paths MANF: max # of pairs with flow of one unit

Hardness Undir graph G=(V,E) and k node-pairs s 1 t 1, s 2 t 2,..., s k t k MEDP: max # of pairs connected by edge-disj paths MNDP: max # of pairs connected by node-disj paths MANF: max # of pairs with flow of one unit MEDP/MNDP/MANF are  (log 1/2- ² n)-hard [Andrews-etal’05]

Approximation Undir graph G=(V,E) and k node-pairs s 1 t 1, s 2 t 2,...,s k t k MEDP: max # of pairs connected by edge-disj paths MNDP: max # of pairs connected by node-disj paths ANF: max # of pairs with flow of one unit MEDP/MNDP have O(n 1/2 )-approx [C-Khanna- Shepherd, Kolliopoulos-Stein] ANF has O(log 2 n) –approx [C-Khanna-Shepherd’05]

Obvious Open Problem MEDP/MNDP/MANF are  (log 1/2- ² n)-hard MEDP/MNDP have O(n 1/2 )-approx Close the gap ! No good relaxation for MEDP/MNDP

Multicommodity Flow Relaxation variable x i for each pair s i t i max  x i s.t G supports multicomm. flow of x i for pair s i t i 0 · x i · 1

Integrality Gap for MEDP/MNDP s1s1 s2s2 sisi s3s3 s k-1 sksk t1t1 t k-1 tktk t3t3 t2t2 titi [GVY]  (n 1/2 ) gap

Routing with Congestion Question: Is integrality gap small with congestion c? O(1) gap with O(log n/log log n) congestion via randomized rounding [Raghavan-Thompson’87] Main interest: constant c and c = 2

Recent Results [Chuzhoy’11] polylog(k) integrality gap for MEDP with congestion 14 [Chuzhoy-Li’12] polylog(k) integrality gap for MEDP with congestion 2 [C-Ene’13] polylog(k) integrality gap for MNDP with congestion 51

Work in Progress [C-Chuzhoy’14] polylog(k) integrality gap for MNDP with congestion 2 Corollary of stronger result polylog(k) integrality gap for ANF with node-capacities where unit flow for routed pair is half-integral Best we can hope for via flow relaxation

Rest of Talk Results follow from structural and algorithmic results on treewidth and well-linked sets Outline connections and recent results on treewidth

Well-linked Sets A set X µ V is well-linked in G if for all A, B µ X there are min(|A|,|B|) node-disjoint A-B paths G

Well-linked Sets A set X µ V is well-linked in G if for all A, B µ X there are min(|A|,|B|) node-disjoint A-B paths G

Well-linked Sets A set X µ V is well-linked in G if for all A, B µ X there are min(|A|,|B|) node-disjoint A-B paths No sparse node-separators for X in G A B C

Treewidth & Well-linked Sets A set X µ V is well-linked in G if for all A, B µ X there are min(|A|,|B|) node-disjoint A-B paths No sparse node-separators for X in G wl(G) = cardinality of the largest well-linked set in G tw(G) = treewidth of G wl(G) · tw(G) · 4 wl(G)

Treewidth and Routing [C-Khanna-Shepherd’05] Reduce integrality gap question to well-linked instances with polylog(k) loss G=(V,E) and terminal set X = {s 1,t 1,...,s k,t k } X is well-linked in G

Treewidth and Routing [C-Khanna-Shepherd’05] Reduce integrality gap question to well-linked instances with polylog(k) loss G=(V,E) and terminal set X = {s 1,t 1,...,s k,t k } X is well-linked in G Question: If tw(G) = k does G have a large routing structure?

Treewidth and Routing Question: If tw(G) = k does G have a large routing structure? [Robertson-Seymour-Thomas] If tw(G) = k and G is planar then G has a grid-minor of size  (k) Grid minors are good routing structures.

X

Treewidth and Routing [Rao-Zhou’08] Idea for general graphs: “Embed” an expander using cut-matching game of [Khandekar-Rao-Vazirani’05]

Treewidth and Routing [Chuzhoy’11,Chuzhoy-Li’12] If tw(G) ¸ k then there is an expander of size k/polylog(k) that can be “embedded” into G with edge congestion 2 [C-Ene’13] If tw(G) ¸ k then there is an expander of size k/polylog(k) that can be “embedded” into G with node congestion 51 [C-Chuzoy’14] improve node congestion to 2

A Structural Result on Treewidth [C-Chuzhoy’13] Informal: Every graph has a path-of-sets-system as a subgraph and whose size depends on the treewidth.

Path-of-Sets System

C1C1 C2C2 C3C3 …CrCr Each C i is a connected cluster The clusters are disjoint Every consecutive pair of clusters connected by h paths All blue paths are disjoint from each other and internally disjoint from the clusters … h

C1C1 C2C2 C3C3 …CrCr … CiCi Interface vertex

C1C1 C2C2 C3C3 …CrCr … CiCi

C1C1 C2C2 C3C3 …CrCr CiCi

C1C1 C2C2 C3C3 …CrCr CiCi

C1C1 C2C2 C3C3 …CrCr CiCi

A Structural Result on Treewidth [C-Chuzhoy’13] Theorem: If tw(G) ¸ k and h r 19 · k/polylog(k) then there G has a path-of-sets systems with parameters h, r. Moreover, a poly-time algorithm to construct it.

Applications From theorem on path-of-sets and additional ideas: Polynomial-sized grid-minor theorem Embedding expander of size k/polylog(k) with node-congestion 2 via cut-matching game Treewidth sparsifier

Theorem: tw(G) ¸ f(k) implies G contains a clique minor of size k or a grid minor of size k Robertson-Seymour Grid- Minor Theorem(s)

Theorem: tw(G) ¸ f(k) implies G contains a clique minor of size k or a grid minor of size k Corollary (Grid-minor theorem): tw(G) ¸ f(k) implies G contains a grid minor of size k Previous best bound: f(k) = 2 O(k 2 log k) [Kawarabayashi- Kobayashi’12, Leaf-Seymour’12] tw(G) ¸ h implies grid minor of size at least (log h) 1/2

Improved Grid-Minor Thm [C-Chuzhoy’13] Theorem: tw(G) ¸ k implies that G has a grid-minor of size  (k ± ) where ± ¸ 1/98 – o(1)

Treewidth Sparsifier [C-Chuzhoy’14] Let tw(G) = k. G has a subgraph H such that tw(H) ¸ k/polylog(k) max deg of H is 3 # of deg 3 nodes in H is O(k 4 ) Poly-time algorithm to construct H given G

Directed Graphs Dir graph MEDP is  (n 1/2- ² ) hard [Guruswami etal] Even with congestion c problem is n  (c) – hard [Chuzhoy-Guruswami-Khanna-Talwar] Symmetric demands: 1.pairs are unordered 2.s i t i routed if (s i,t i ) and (t i,s i ) are routed

Directed Graphs with Symmetric Demands Symmetric demands: 1.pairs are unordered 2.s i t i routed if (s i,t i ) and (t i,s i ) are routed Conjecture: polylog(k) approx with constant congestion via LP feasible for MEDP/MNDP [C-Ene’13] polylog(k) integrality gap/approx for ANF with symmetric demands with O(1) congestion Connection to directed treewidth

Directed Treewidth Question: If G has directed treewidth k does it have a routing structure of size k/polylog(k) ?

Open Problems Improve Grid-Minor theorem parameters Similar results for directed treewidth? Several “lower-level” research questions

Thank You!