/
Routing in Undirected Graphs with Constant Congestion Routing in Undirected Graphs with Constant Congestion

Routing in Undirected Graphs with Constant Congestion - PowerPoint Presentation

pamella-moone
pamella-moone . @pamella-moone
Follow
404 views
Uploaded On 2016-03-24

Routing in Undirected Graphs with Constant Congestion - PPT Presentation

Julia Chuzhoy Toyota Technological Institute at Chicago Routing Problems Input Graph G sourcesink pairs s 1 t 1 s k t k Goal Route as many pairs as possible minimize edge congestion ID: 267982

expander congestion edge pairs congestion expander pairs edge good linked graph disjoint polylog vertex route approximation paths terminals subsets

Share:

Link:

Embed:

Download Presentation from below link

Download Presentation The PPT/PDF document "Routing in Undirected Graphs with Consta..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.


Presentation Transcript