Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

87

STOC
2012
ACM

favoriteEmaildiscussreport

199views Algorithms» more STOC 2012»

Routing in undirected graphs with constant congestion

13 years 2 days ago

Routing in undirected graphs with constant congestion

Download ttic.uchicago.edu

Julia Chuzhoy

Real-time Traffic

Algorithms | STOC 2012 |

claim paper

Related Content

» Edgedisjoint paths in Planar graphs with constant congestion

» Inapproximability of edgedisjoint paths and low congestion routing on undirected graphs

» Hardness of the undirected congestion minimization problem

» EdgeDisjoint Paths in Planar Graphs

» FISSIONE a scalable constant degree and low congestion DHT scheme based on Kautz graphs

» On Certain Connectivity Properties of the Internet Topology

» Fast Periodic Graph Exploration with Constant Memory

» Hardness of routing with congestion in directed graphs

» CrossMonotonic Multicast

Post Info
More Details (n/a)

Added	28 Sep 2012
Updated	28 Sep 2012
Type	Journal
Year	2012
Where	STOC
Authors	Julia Chuzhoy

Comments (0)