Back to Search
Start Over
The maximum edge-disjoint paths problem in complete graphs
- Source :
-
Theoretical Computer Science . Jun2008, Vol. 399 Issue 1/2, p128-140. 13p. - Publication Year :
- 2008
-
Abstract
- 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 -approximation, for all . 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 -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. [Copyright &y& Elsevier]
- Subjects :
- *ALGORITHMS
*COMPUTER training
*GRAPH theory
*COMPUTER science
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 399
- Issue :
- 1/2
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 31922585
- Full Text :
- https://doi.org/10.1016/j.tcs.2008.02.017