Abstract
We give a general framework to handle node-connectivity degree constrained problems. In particular, for the k -Outconnected Subgraph problem, for both directed and undirected graphs, our algorithm computes in polynomial time a solution J of cost O(logk) times the optimal, such that deg J (v) = O(2k) ·b(v) for all v ∈ V. Similar result are obtained for the Element-Connectivity and the k -Connected Subgraph problems. The latter is a significant improvement on the particular case of only degree-approximation and undirected graphs considered in [5]. In addition, for the edge-connectivity directed Degree-Constrained k -Outconnected Subgraph problem, we slightly improve the best known approximation ratio, by a simple proof.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Auletta, V., Dinitz, Y., Nutov, Z., Parente, D.: A 2-approximation algorithm for finding an optimum 3-vertex-connected spanning subgraph. J. of Algorithms 32(1), 21–30 (1999)
Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree bounded directed network design. SIAM J. Computing 39(4), 1413–1431 (2000)
Chan, Y., Fung, W., Lau, L., Yung, C.: Degree bounded network design with metric costs. SIAM J. on Computing 40(4), 953–980 (2011)
Chuzhoy, J., Khanna, S.: An O(k 3 logn)-approximation algorithm for vertex-connectivity survivable network design. In: FOCS, pp. 437–441 (2009)
Feder, T., Motwani, R., Zhu, A.: k-connected spanning subgraphs of low degree. Electronic Colloquium on Computational Complexity (ECCC) 13(041) (2006)
Fleischer, L., Jain, K., Williamson, D.: Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems. J. Computer and System Sciences 72(5), 838–867 (2006)
Frank, A.: Rooted k-connections in digraphs. Discrete Applied Mathematics 157, 1242–1254 (2009)
Fukunaga, T., Nagamochi, H.: Network design with weighted degree constraints. Discrete Optimization 7(4), 246–255 (2010)
Khandekar, R., Kortsarz, G., Nutov, Z.: Network-Design with Degree Constraints. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) RANDOM 2011 and APPROX 2011. LNCS, vol. 6845, pp. 289–301. Springer, Heidelberg (2011)
Khuller, S., Raghavachari, B.: Improved approximation algorithms for uniform connectivity problems. Journal of Algorithms 21, 434–450 (1996)
Kortsarz, G., Nutov, Z.: Approximating node connectivity problems via set covers. Algorithmica 37, 75–92 (2003)
Lau, L., Naor, J., Salavatipour, M., Singh, M.: Survivable network design with degree or order constraints. SIAM J. Computing 39(3), 1062–1087 (2009)
Lau, L., Singh, M.: Additive approximation for bounded degree survivable network design. In: STOC, pp. 759–768 (2008)
Lau, L.C., Ravi, R., Singh, M.: Iterative Methods in Combinatorial Optimization. Cambridge University Press (2011)
Nutov, Z.: Approximating directed weighted-degree constrained networks. Theoretical Computer Science 408(8-10), 901–912 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nutov, Z. (2012). Degree-Constrained Node-Connectivity. In: Fernández-Baca, D. (eds) LATIN 2012: Theoretical Informatics. LATIN 2012. Lecture Notes in Computer Science, vol 7256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29344-3_49
Download citation
DOI: https://doi.org/10.1007/978-3-642-29344-3_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29343-6
Online ISBN: 978-3-642-29344-3
eBook Packages: Computer ScienceComputer Science (R0)