Results 1  10
of
100,540
EDGE–DISJOINT PATHS IN PERMUTATION GRAPHS
"... In this paper we consider the following problem. Given an undirected graph G = (V,E) and vertices s1, t1; s2, t2, the problem is to determine whether or not G admits two edge–disjoint paths P1 and P2 connecting s1 with t1 and s2 with t2, respectively. We give a linear (O(V + E)) algorithm to s ..."
Abstract
 Add to MetaCart
In this paper we consider the following problem. Given an undirected graph G = (V,E) and vertices s1, t1; s2, t2, the problem is to determine whether or not G admits two edge–disjoint paths P1 and P2 connecting s1 with t1 and s2 with t2, respectively. We give a linear (O(V + E)) algorithm
Edge Disjoint Paths Revisited
 In Proceedings of the 14th ACMSIAM Symposium on Discrete Algorithms
, 2003
"... The approximability of the maximum edge disjoint paths problem (EDP) in directed graphs was seemingly settled by the )hardness result of Guruswami et al. [10] and the O( m) approximation achievable via both the natural LP relaxation [19] and the greedy algorithm [11, 12]. Here m is the numb ..."
Abstract

Cited by 39 (4 self)
 Add to MetaCart
The approximability of the maximum edge disjoint paths problem (EDP) in directed graphs was seemingly settled by the )hardness result of Guruswami et al. [10] and the O( m) approximation achievable via both the natural LP relaxation [19] and the greedy algorithm [11, 12]. Here m
EdgeDisjoint Paths in Expander Graphs
, 2000
"... Given a graph G = (V, E) and a set of n pairs of vertices in V, we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the set of n paths so found is edgedisjoint. (For arbitrary graphs the problem is AfPcomplete, although it is in 7 > if n is fixed.) We ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
Given a graph G = (V, E) and a set of n pairs of vertices in V, we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the set of n paths so found is edgedisjoint. (For arbitrary graphs the problem is AfPcomplete, although it is in 7 > if n is fixed.) We
Edgedisjoint Paths in Graphs on Surfaces
"... We present a survey of results on the edgedisjoint paths problem and relate this problem to the edgedisjoint homotopic path and the edgedisjoint homotopic cycle problem. The latter problem is: given a graph G =(V � E) embedded on a surface S and closed curves C1�:::�Ck on S, nd necessary and su c ..."
Abstract
 Add to MetaCart
We present a survey of results on the edgedisjoint paths problem and relate this problem to the edgedisjoint homotopic path and the edgedisjoint homotopic cycle problem. The latter problem is: given a graph G =(V � E) embedded on a surface S and closed curves C1�:::�Ck on S, nd necessary and su
Approximation algorithms for edgedisjoint paths and unsplittable flow
 Efficient Approximation and Online Algorithms
, 2006
"... Abstract. In the maximum edgedisjoint paths problem (MEDP) the input consists of a graph and a set of requests (pairs of vertices), and the goal is to connect as many requests as possible along edgedisjoint paths. We give a survey of known results about the complexity and approximability of MEDP ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. In the maximum edgedisjoint paths problem (MEDP) the input consists of a graph and a set of requests (pairs of vertices), and the goal is to connect as many requests as possible along edgedisjoint paths. We give a survey of known results about the complexity and approximability of MEDP
The Maximum EdgeDisjoint Paths Problem In Bidirected Trees
 SIAM Journal on Discrete Mathematics
, 1998
"... . A bidirected tree is the directed graph obtained from an undirected tree by replacing each undirected edge by two directed edges with opposite directions. Given a set of directed paths in a bidirected tree, the goal of the maximum edgedisjoint paths problem is to select a maximumcardinality subse ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
. A bidirected tree is the directed graph obtained from an undirected tree by replacing each undirected edge by two directed edges with opposite directions. Given a set of directed paths in a bidirected tree, the goal of the maximum edgedisjoint paths problem is to select a maximumcardinality
Edgedisjoint paths in planar graphs with constant congestion
 IN PROCEEDINGS OF THE 38TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, 2006
, 2009
"... We study the maximum edgedisjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2,..., sktk, the goal is to maximize the number of demands that can be connected (routed) by edgedisjoint paths. The natural multicommodity flow relaxation has an Ω ( √ ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
We study the maximum edgedisjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2,..., sktk, the goal is to maximize the number of demands that can be connected (routed) by edgedisjoint paths. The natural multicommodity flow relaxation has an Ω
Greedy EdgeDisjoint Paths in Complete Graphs
, 2001
"... The maximum edgedisjoint path problem (MEDP) is one of the most classical NPhard problems [5]. We consider MEDP in complete graphs. ErlebachVukadinovi'c [4] showed that MEDP in complete graphs is NPhard and has a constantfactor approximation algorithm. A recent work [9] by KolmanScheidel ..."
Abstract
 Add to MetaCart
The maximum edgedisjoint path problem (MEDP) is one of the most classical NPhard problems [5]. We consider MEDP in complete graphs. ErlebachVukadinovi'c [4] showed that MEDP in complete graphs is NPhard and has a constantfactor approximation algorithm. A recent work [9] by Kolman
Abstract EdgeDisjoint Paths in Expander Graphs
"... Given a graph G = (17, E) and a set of t ¢ pairs of vertices in V, we are interested in finding for each pair (hi, b~), a path connecting ai to bi, such that the set of t ¢ paths so found is edgedisjoint. (For arbitrary graphs the problem is AfT~complete, although it is in 7 ~ if n is fixed.) We p ..."
Abstract
 Add to MetaCart
Given a graph G = (17, E) and a set of t ¢ pairs of vertices in V, we are interested in finding for each pair (hi, b~), a path connecting ai to bi, such that the set of t ¢ paths so found is edgedisjoint. (For arbitrary graphs the problem is AfT~complete, although it is in 7 ~ if n is fixed.) We
Greedy EdgeDisjoint Paths in Complete Graphs
, 2003
"... The maximum edgedisjoint paths problem (MEDP) is one of the most classical NPhard problems. We study the approximation ratio of a simple and practical approximation algorithm, the shortestpathfirst greedy algorithm (SGA), for MEDP in complete graphs. Previously, it was known that this ratio is a ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The maximum edgedisjoint paths problem (MEDP) is one of the most classical NPhard problems. We study the approximation ratio of a simple and practical approximation algorithm, the shortestpathfirst greedy algorithm (SGA), for MEDP in complete graphs. Previously, it was known that this ratio
Results 1  10
of
100,540