Sciweavers

162 search results - page 2 / 33
» The Induced Disjoint Paths Problem
Sort
View
MOR
2000
162views more  MOR 2000»
15 years 3 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
SODA
2010
ACM
278views Algorithms» more  SODA 2010»
16 years 18 days ago
The edge disjoint paths problem in Eulerian graphs and $4$-edge-connected graphs
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
Ken-ichi Kawarabayashi, Yusuke Kobayashi