-
...3-ε m approximation for the undirected edge-disjoint paths problem unless np ⊆ zptime(npolylog(n), where m is the size of the graph and ε is any positive constant. this hardness result also applies to the undirected all-or-nothing multicommodity flow problem and the undirected node-disjoint paths problem....
-
...in the edge-disjoint paths problem with congestion (edpwc), we are...can be routed through any edge in the graph. when c = 1, the problem is simply referred to as the edge-disjoint paths (edp) problem. in this paper, we study...
-
...amp;epsiv; m approximation for the undirected edge-disjoint paths problem unless np ⊆ zptime(npolylog(n)), where m is the size of the graph and ϵ is any positive constant. this hardness result also applies to the undirected all-or-nothing multicommodity flow problem and the undirected node-disjoint paths problem....
-
...in the edge-disjoint paths (edp) problem, we are given a graph...in this paper, we improve the hardness result of (1) as well as obtain the rst polylogarithmic inte- grality gaps and hardness results for undirected edp when congestion is allowed...
-
...speed networks.
as an extension of the disjoint paths problem, we introduce a new problem which we call the induced disjoint paths problem.
in this problem we are given a graph...is motivated by not only the disjoint paths problem but also the recognition
of an induced subgraph. the latter has been developed in the recent years, and this is...
-
...abstract: in the edge-disjoint paths problem with congestion (edpwc), we are...can be routed through any edge in the graph. in this paper, we study the hardness of edpwc in undirected graphs. we show that for...
Published in 2005.
-
...study an approximation algorithm for the maximum edge-disjoint paths problem. in the maximum edge-disjoint
paths problem, we are given a graph...o(logn)-approximation algorithm for the maximum edge-disjoint paths problem when an input graph is either 4-edge-connected planar
or eulerian planar...
-
...we study the approximability of edge-disjoint paths and related problems. in the edge-disjoint paths problem (edp), we are given a...networks, we show that even the single source-sink pair case (i.e. nd the maximum number of paths of bounded length between a given...
-
...in the undirected edge-disjoint paths problem with congestion (edpwc), we are...can be routed through any edge in the graph. when c = 1, the problem is simply referred to as the edge-disjoint paths (edp) problem. in this paper, we study...
-
...we study the maximum edge-disjoint paths problem (medp). we are given a graph and a set of pairs of vertices: the objec- tive is to find the maximum number of pairs in that can be...