Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints
Journal of Computer and System Sciences
The complexity of path coloring and call scheduling
Theoretical Computer Science
Improved bounds for the unsplittable flow problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Maximum Edge-Disjoint Paths Problem in Bidirected Trees
SIAM Journal on Discrete Mathematics
New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
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
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
| Hi-index | 0.00 |
The paper deals with the well known Maximum Edge Disjoint Paths Problem (MaxEDP), restricted to complete graphs. We propose an off-line 3.75-approximation algorithm and an on-line 6.47-approximation algorithm, improving earlier 9-approximation algorithms due to Carmi, Erlebach and Okamoto (Proceedings WG'03, 143–155). Next, it is shown that no on-line algorithm for the considered problem is ever better than a 1.50-approximation. Finally, the proposed approximation techniques are adapted for other routing problems in complete graphs, leading to an off-line 3-approximation (on-line 4-approximation) for routing with minimum edge load, and an off-line 4.5-approximation (on-line 6-approximation) for routing with a minimum number of WDM wavelengths