Approximating k-outconnected subgraph problems
We present approximation algorithms and structural results for problems in network design. We give improved approximation algorithms for finding min-cost k-outconnected graphs with either a single root or multiple roots for (i) uniform costs, and (ii) metric costs. The improvements are obtained by focusing on single-root k-outconnected graphs and proving (i) a version of Mader's critical cycle theorem and (ii) an extension of a splitting off theorem by Bienstock et al.
Unable to display preview. Download preview PDF.
- 2.B. Bollobás, Extremal Graph Theory, Academic Press, London, 1978.Google Scholar
- 3.J.Cheriyan and R.Thurimella, “Approximating minimum-size k-connected spanning subgraphs via matching,” manuscript, Sept. 1996. ECCC TR98-025, see http://www.eccc.uni-trier.de/eccc-local/Lists/TR-1998.html. Preliminary version in Proc. 37th IEEE FOCS (1996), 292–301.Google Scholar
- 8.S. Khuller, “Approximation algorithms for finding highly connected subgraphs,” in Approximation algorithms for NP-hard problems, Ed. D. S. Hochbaum, PWS publishing co., Boston, 1996.Google Scholar
- 12.Z.Nutov, M.Penn and D.Sinreich, “On mobile robots flow in locally uniform networks,” Canadian Journal of Information Systems and Operational Research 35 (1997), 197–208.Google Scholar