Abstract
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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Andrews, M., Zhang, L.: Hardness of the undirected edge-disjoint paths problem. In: Proc. STOC 2005, pp. 276–283 (2005)
Beauquier, B., Bermond, J.C., Gargano, L., Hell, P., Pèrennes, S., Vaccaro, U.: Graph problems arising from wavelength routing in all-optical networks. In: Proc. WOCS 1997, Geneve, Switzerland (1997)
Białogrodzki, J.: Path Coloring and Routing in Graphs. In: Kubale, M. (ed.) Graph Colorings. Contemporary Math, vol. 352, pp. 139–152. AMS, USA (2004)
Carmi, P., Erlebach, T., Okamoto, Y.: Greedy edge-disjoint paths in complete graphs. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 143–155. Springer, Heidelberg (2003)
Choplin, S., Narayanan, L., Opatrny, J.: Two-Hop Virtual Path Layout in Tori. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 69–78. Springer, Heidelberg (2004)
Erlebach, T., Jansen, K.: The complexity of path coloring and call scheduling. Theoret. Comp. Sci. 255, 33–50 (2001)
Erlebach, T., Jansen, K.: The Maximum Edge-Disjoint Paths Problem in Bidirected Trees. SIAM J. Discret. Math. 14, 326–355 (2001)
Erlebach, T., Vukadinović, D.: New results for path problems in generalized stars, complete graphs, and brick wall graphs. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 483–494. Springer, Heidelberg (2001)
Favrholdt, L.M., Nielsen, M.N.: On-line edge-coloring with a fixed number of colors. Algorithmica 35, 176–191 (2003)
Fiorini, S., Wilson, R.J.: Edge-Colourings of Graphs. Pittman, USA (1977)
Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proc. SODA 1990, pp. 434–443 (1990)
Guruswami, V., et al.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67, 473–496 (2003)
Kolman, P., Scheideler, C.: Improved bounds for the unsplittable flow problem. In: Proc. SODA 2002, pp. 184–193 (2002)
Ma, B., Wang, L.: On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints. J. Comput. Syst. Sci. 60, 1–12 (2000)
Srinivasan, A.: Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In: Proc. FOCS 1997, pp. 416–425 (1997)
Tutte, W.T.: A short proof of the factor theorem for finite graphs. Canad. J. Math. 6, 347–352 (1954)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kosowski, A. (2006). Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs. In: Flocchini, P., Gąsieniec, L. (eds) Structural Information and Communication Complexity. SIROCCO 2006. Lecture Notes in Computer Science, vol 4056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780823_11
Download citation
DOI: https://doi.org/10.1007/11780823_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35474-1
Online ISBN: 978-3-540-35475-8
eBook Packages: Computer ScienceComputer Science (R0)