The maximum edge-disjoint paths problem in complete graphs

Authors:
Adrian Kosowski
Affiliations:
Department of Algorithms and System Modeling, Gdask University of Technology, Narutowicza 11/12, 80-952 Gdask, Poland
Venue:
Theoretical Computer Science
Year:
2008

Citing 6
Cited 2

Efficient routing in all-optical networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Improved bounds for the unsplittable flow problem

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

Journal of Computer and System Sciences
Hardness of the undirected edge-disjoint paths problem

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Forwarding and optical indices of a graph

Discrete Applied Mathematics
Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

Journal of Computer and System Sciences

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we consider the undirected version of the well known maximum edge-disjoint paths problem, restricted to complete graphs. We propose an off-line 3.75-approximation algorithm and an on-line 6.47-approximation algorithm, improving the earlier 9-approximation algorithm proposed by Carmi, Erlebach, and Okamoto [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Moreover, we show that for the general case, no on-line algorithm is better than a (2-@e)-approximation, for all @e0. For the special case when the number of paths is within a linear factor of the number of vertices of the graph, it is established that the problem can be optimally solved in polynomial time by an off-line algorithm, but that no on-line algorithm is better than a (1.5-@e)-approximation. Finally, the proposed techniques are used to obtain off-line and on-line algorithms with a constant approximation ratio for the related problems of edge congestion routing and wavelength routing in complete graphs.