Sciweavers

2 search results - page 1 / 1
» Inapproximability of edge-disjoint paths and low congestion ...
Sort
View
ECCC
2007
147views more  ECCC 2007»
13 years 3 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
FOCS
2004
IEEE
13 years 7 months ago
Edge-Disjoint Paths in Planar Graphs
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd