edge-disjoint paths | Sciweavers

64

ECCC
2007

147views more ECCC 2007»

Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs

13 years 10 months ago

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...

claim paper

Read More »

48

click to vote

APPROX
2010
Springer

135views Algorithms» more APPROX 2010»

Monotonicity Testing and Shortest-Path Routing on the Cube

13 years 11 months ago

Download homepages.cwi.nl

We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...

Jop Briët, Sourav Chakraborty, David Garc&iac...

claim paper

Read More »

53

click to vote

FOCS
2004
IEEE

175views Theoretical Computer Science» more FOCS 2004»

Edge-Disjoint Paths in Planar Graphs

14 years 2 months ago

Download www.cs.uiuc.edu

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

claim paper

Read More »

45

click to vote

FOCS
2007
IEEE

114views Theoretical Computer Science» more FOCS 2007»

Finding Disjoint Paths in Expanders Deterministically and Online

14 years 5 months ago

Download www.cs.tau.ac.il

We describe a deterministic, polynomial time algorithm for ﬁnding edge-disjoint paths connecting given pairs of vertices in an expander. Speciﬁcally, the input of the algorith...

Noga Alon, Michael R. Capalbo

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers